2016年8月4日
LeetCode-Insert Delete GetRandom O(1)
摘要： Design a data structure that supports all following operations in O(1) time. Example: Analysis: For O(1) insert and remove, we need HashMap. For O(1) 阅读全文
posted @ 2016-08-04 14:02 LiBlog 阅读(441) 评论(0) 推荐(0) 编辑