LeetCode | 347. Top K Frequent Elements

.

题目

Given an integer array nums and an integer k, return the k most frequent elements. You may return the answer in any order.

Example 1:

Input: nums = [1,1,1,2,2,3], k = 2
Output: [1,2]

Example 2:

Input: nums = [1], k = 1
Output: [1]

Constraints:

• 1 <= nums.length <= 105
• k is in the range [1, the number of unique elements in the array].
• It is guaranteed that the answer is unique.

Follow up: Your algorithm’s time complexity must be better than O(n log n), where n is the array’s size.

.

代码

class Solution {
public:
    static int cmp(pair<int, int>& x, pair<int, int>& y) {
        return x.second > y.second;
    }
    vector<int> topKFrequent(vector<int>& nums, int k) {
        map<int, int> m;
        vector<pair<int, int>> v;
        for(int i = 0; i<nums.size(); i++)
        {
            if(m.find(nums[i]) != m.end())
                m[nums[i]]++;
            else
                m.insert(pair<int, int>(nums[i], 1));
        }
        for(map<int, int>::iterator iter = m.begin(); iter != m.end(); iter++)
            v.push_back(pair<int, int>(iter->first, iter->second));
        sort(v.begin(), v.end(), cmp);
        vector<int> res;
        for(int i = 0; i<k; i++)
            res.push_back(v[i].first);
        return res;
    }
};

.

虽然也是一次AC，但效率堪忧呀2333333

.