什么台灯好？能保护眼睛？# Parenting - 为人父母
Y*B
1 楼
How to use Double Linked List and Hashmap to implement a LRU cache?
d*h
2 楼
rt
s*n
3 楼
1. when you want to get one item, say Ai, check hash if it is in the cache.
a. yes, get the address, and move the node to the last.
b. no, remove the recent one and put it in the cache and address in hash
2. double linked is easy to to remove from middle.
a. yes, get the address, and move the node to the last.
b. no, remove the recent one and put it in the cache and address in hash
2. double linked is easy to to remove from middle.
y*i
4 楼
CO 求推荐
【在 d********h 的大作中提到】
: rt
【在 d********h 的大作中提到】
: rt
Y*B
5 楼
thanks
how to construct the data structure?
how to construct the data structure?
h*t
6 楼
three!
w*x
7 楼
Use bit map to map key and memory so it can locate the memory in O(1)
Use double linked list to implement a cycle queue (I'd like to choose an
array), if the queue is full, newly queried key will erase the earliest key.
You need to maintain both hash map and cycle queue at the same time as new
query comes.
Use double linked list to implement a cycle queue (I'd like to choose an
array), if the queue is full, newly queried key will erase the earliest key.
You need to maintain both hash map and cycle queue at the same time as new
query comes.
相关阅读