2017年12月13日
Design a key value data structure support Get/Fetch/Delete/RandomDelete all in O(1)
摘要： 1 Implement a Key-Value pair datastucture such that there is: 2 O(1) insertion void insert(K, V) 3 O(1) fetching 4 O(1) deletion ... 阅读全文
posted @ 2017-12-13 08:26 逸朵 阅读(145) 评论(0) 推荐(0)
Leetcode 347: Top K Frequent Elements
摘要： Given a non-empty array of integers, return the k most frequent elements. For example,Given [1,1,1,2,2,3] and k = 2, return [1,2]. Note: You may assum 阅读全文
posted @ 2017-12-13 02:35 逸朵 阅读(123) 评论(0) 推荐(0)