2014年5月19日
【LeetCode】LRU Cache
摘要： Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations:getandset.get(key)- Get the valu... 阅读全文
posted @ 2014-05-19 22:55 一弦一仙 阅读(225) 评论(0) 推荐(0)
【LeetCode】Partition List
摘要： Given a linked list and a valuex, partition it such that all nodes less thanxcome before nodes greater than or equal tox.You should preserve the origi... 阅读全文
posted @ 2014-05-19 11:45 一弦一仙 阅读(144) 评论(0) 推荐(0)