momo's

Cracking LeetCode: 138. Copy List with Random Pointer

May
11

A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null. Return a deep copy of the list. Thought: Associate the original list and the copy list side by side, and after copying the random pointer, split the original list and the copy […]…

Tech/技术 , , Comments Off on Cracking LeetCode: 138. Copy List with Random Pointer

Cracking LeetCode: 146. LRU Cache

May
11

Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and put. get(key) – Get the value (will always be positive) of the key if the key exists in the cache, otherwise return -1. put(key, value) – Set or insert the value if the key is […]…

Tech/技术 , Comments Off on Cracking LeetCode: 146. LRU Cache
Scroll Up