Leetcode刷题笔记(c++)_热题 HOT 100_347. 前 K 个高频元素

排序

class Solution {
public:
    vector<int> topKFrequent(vector<int>& nums, int k) {
        sort(nums.begin(),nums.end());
        vector<vector<int>>v;
        v.push_back({1,nums[0]});
        int i=1;
        while(i<nums.size()){
            // cout<<"i:"<<i<<" "<<nums[i]<<endl;
            if(nums[i-1]!=nums[i]){
                vector<int>a(2);
                a[0]=1;
                a[1]=nums[i];
                v.push_back(a);
            }else{
                v.back()[0]++;
            }
            // cout<<v.back()[0]<<" "<<v.back()[1]<<endl;
            i++;
        }
        sort(v.begin(),v.end());
        int n=v.size();
        nums.clear();
        for(int i=1;i<=k;i++){
            // cout<<v[n-i][0]<<" "<<v[n-i][1]<<endl;
            nums.push_back(v[n-i][1]);
        }            
        return nums;
    }
};