摘要: Koko loves to eat bananas. There are N piles of bananas, the i-th pile has piles[i] bananas. The guards have gone and will come back in H hours. Koko 阅读全文
posted @ 2018-08-30 14:40 轻风舞动 阅读(663) 评论(0) 推荐(0) 编辑
摘要: Design and implement a data structure for Least Frequently Used (LFU) cache. It should support the following operations: get and put. get(key) - Get t 阅读全文
posted @ 2018-08-30 02:09 轻风舞动 阅读(517) 评论(0) 推荐(0) 编辑