摘要:
Design a data structure that supports all following operations in average O(1) time. insert(val): Inserts an item val to the set if not already presen 阅读全文
posted @ 2018-11-15 21:44
Veritas_des_Liberty
阅读(245)
评论(0)
推荐(0)
摘要:
Design a simplified version of Twitter where users can post tweets, follow/unfollow another user and is able to see the 10 most recent tweets in the u 阅读全文
posted @ 2018-11-15 21:03
Veritas_des_Liberty
阅读(196)
评论(0)
推荐(0)
摘要:
Given a non-empty array of integers, return the k most frequent elements. Example 1: Input: nums = [1,1,1,2,2,3], k = 2 Output: [1,2] Example 2: Input 阅读全文
posted @ 2018-11-15 15:13
Veritas_des_Liberty
阅读(256)
评论(0)
推荐(0)
摘要:
Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the arr 阅读全文
posted @ 2018-11-15 14:37
Veritas_des_Liberty
阅读(252)
评论(0)
推荐(0)

浙公网安备 33010602011771号