摘要: Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and set. get(key) - Get the 阅读全文
posted @ 2016-10-31 09:59 咖啡中不塌缩的方糖 阅读(148) 评论(0) 推荐(0) 编辑
摘要: public class Heap where T : IComparable { private List elements = new List(); public int GetSize() { return elements.Count; } public ... 阅读全文
posted @ 2016-10-31 03:23 咖啡中不塌缩的方糖 阅读(316) 评论(0) 推荐(0) 编辑