LRUCache leetcode146
class LRUCache:
def __init__(self, capacity: int):
self.remain=capacity
self.dic=collections.OrderedDict()
def get(self, key: int) -> int:
if key not in self.dic:
return -1
v = self.dic.pop(key)
self.dic[key]=v
return v
def put(self, key: int, value: int) -> None:
if key in self.dic:
self.dic.pop(key)
else:
if self.remain>0:
self.remain-=1
else:
self.dic.popitem(last=False)
self.dic[key]=value
布隆过滤器
课程总结
模板
递归模板
DFS
BFS
二分查找
DP模板
位运算
切题