[leetcode 347] Top K Frequent Elements
Given a non-empty array of integers, return the k most frequent elements. 주어진 배열에서 가장 자주 등장하는 요소 k번째까지 리턴하기 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: You may assume k is always valid, 1 ≤ k ≤ number of unique elements. Your algorithm's time complexity must be better than O(n log n), where n is the array's size. It's guarante..
2020. 10. 18.