2013年11月18日
LRU Cache [LeetCode]
摘要： Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations:getandset.get(key)- Get the value (will always be positive) of the key if the key exists in the cache, otherwise return -1.set(key, value)- Set or insert the value if the key is not 阅读全文
posted @ 2013-11-18 06:21 假日笛声 阅读(547) 评论(0) 推荐(0)