[leetcode] 347. Top K Frequent Elements

Question:

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 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.

Solution:

算法复杂度为O(n)。

大致思路是：

1. 用map记录每个不同的数字出现的次数。
2. 用桶排序对次数进行排序。
3. 用map构造出从次数到数字的映射，即 1 的逆映射
4. 根据桶排序得到的次数从最高开始，查找上一步得到的map所对应的数字加入返回数组，最后返回该数组。

class Solution {
public:
    vector<int> topKFrequent(vector<int>& nums, int k) {
        vector<int> ret;
        if (nums.size() == 0)
            return ret;

        // number : times O(n)
        map<int, int> m;
        for (int i : nums) {
            if (m.find(i) != m.end())
                m[i]++;
            else
                m[i] = 1;
        }

        // find minimum and maximum times O(n)
        int min = nums.size(), max = 0;
        for (auto i : m) {
            if (min > i.second)
                min = i.second;
            if (max < i.second)
                max = i.second;
        }

        // bucket sort O(n)
        vector<int> bucket(max - min + 1, 0);
        for (auto i : m) {
            bucket[i.second - min]++;
        }

        // time: numbers O(n)
        map<int, vector<int>> m2;
        for (auto i : m) {
            if (m2.find(i.second) != m2.end())
                m2[i.second].push_back(i.first);
            else 
                m2[i.second] = vector<int>(1, i.first);
        }

        // find top k O(n)
        int i = bucket.size() - 1;
        while (k > 0) {
            if (bucket[i] == 0) {
                i--;
                continue;
            }
            for (int j : m2[i + min]) {
                if (k == 0)
                    break;
                ret.push_back(j);
                k--;
            }
            i--;
        }

        return ret;

    }
};