347. Top K Frequent Elements

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.

解题思路： 将数据的统计分布放到hashmap中，然后使用优先队列heap，找出最高的那几个数据。这里用到了Java的PriorityQueue, offer表示插入，poll表示排序。

class Pair{
    int num;
    int count;
    public Pair(int num, int count){
        this.num=num;
        this.count=count;
    }
}

public class Solution {
    public List<Integer> topKFrequent(int[] nums, int k) {

        Map<Integer, Integer> map = new HashMap<Integer, Integer>();
        int len = nums.length;
        for(int i = 0; i < len; i++)
        {
            if(map.containsKey(nums[i]))
            {
                int value = map.get(nums[i]);
                value ++;
                map.put(nums[i], value);
            }else{
                map.put(nums[i], 1);
            }
        }
        PriorityQueue<Pair> queue = new PriorityQueue<Pair>(new Comparator<Pair>(){
            public int compare(Pair a, Pair b){
                return a.count-b.count;
            }
        });

        for(Map.Entry<Integer, Integer> entry: map.entrySet()){
            Pair p = new Pair(entry.getKey(), entry.getValue());
            queue.offer(p);  //insert
            if(queue.size() > k){
                queue.poll();
            }
        }
        //get all elements from the heap
        List<Integer> result = new ArrayList<Integer>();
        while(queue.size() > 0)
        {
            result.add(queue.poll().num);
        }
        Collections.reverse(result);
        return result;

    }
}