- 博客(2)
- 资源 (1)
- 收藏
- 关注
原创 Leetcode: 347. Top K Frequent Elements
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: nums = [1], k = 1 Output: [1] Note: Yo...
2019-09-14 17:01:31 116
原创 Leetcode 215: Find Kth Largest Element in an array
题目: Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element. Example 1: Input: [3,2,1,5,6,4] and k = 2 Output: ...
2019-09-01 09:01:08 202
Algorithm (4th), by Robert Sedgewick
2012-04-07
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人