Top K Frequent Elements

最新推荐文章于 2024-10-01 18:51:18 发布

kaqi072821

最新推荐文章于 2024-10-01 18:51:18 发布

阅读量98

点赞数

分类专栏：算法文章标签： java

本文链接：https://blog.csdn.net/kaqi072821/article/details/84802907

版权

算法专栏收录该内容

6 篇文章 0 订阅

订阅专栏

import java.util.*;

public class Solution {

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

        HashMap<Integer, Integer> numberOccur = getNumOccur(nums);

        PriorityQueue<Integer> priorityQueue = new PriorityQueue<>((o1, o2) -> numberOccur.get(o1) - numberOccur.get(o2));

        Set<Map.Entry<Integer, Integer>> entries = numberOccur.entrySet();
        for(Map.Entry<Integer, Integer> entry:entries){
            priorityQueue.add(entry.getKey());
            if(priorityQueue.size()>k){
                priorityQueue.poll();
            }
        }
        ArrayList<Integer> result = new ArrayList<>();

        for (int i = 0; i < k; i++) {
            result.add(priorityQueue.poll());
        }
        Collections.reverse(result);
        return result;
    }

    private HashMap<Integer, Integer> getNumOccur(int[] nums) {
        HashMap<Integer, Integer> numberOccur = new HashMap<>();
        for (int num : nums) {
            if (numberOccur.get(num) == null) {
                numberOccur.put(num, 0);
            }
            numberOccur.put(num, numberOccur.get(num) + 1);
        }
        return numberOccur;
    }

}