题目描述：
LeetCode 352. Data Stream as Disjoint Intervals
Given a data stream input of non-negative integers a1, a2, ..., an, ..., summarize the numbers seen so far as a list of disjoint intervals.
For example, suppose the integers from ...
归档 2016年5月
[LeetCode]Data Stream as Disjoint Intervals
[LeetCode]Intersection of Two Arrays II
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 350. Intersection of Two Arrays II
Given two arrays, write a function to compute their intersection.
Example:
Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2, 2].
Note:
- Each element in the result should appear as ...
[LeetCode]Intersection of Two Arrays
作者是
发布于
在
LeetCode.
题目描述：
Given two arrays, write a function to compute their intersection.
Example:
Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2].
Note:
- Each element in the result must be unique.
- The result can be in any order.
题目大意 ...
[LeetCode]Top K Frequent Elements
作者是
发布于
在
LeetCode.
题目描述：
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 assume k is ...