LeetCode 347 Top K Frequent Elements (HashMap && TreeMap 或 PriorityQueue 推荐)

最新推荐文章于 2023-11-03 16:44:36 发布

_TCgogogo_

最新推荐文章于 2023-11-03 16:44:36 发布

阅读量1.7k

点赞数

分类专栏： Leetcode Medium 数据结构 LeetCode 文章标签： LeetCode TreeMap PriorityQueue

本文链接：https://blog.csdn.net/Tc_To_Top/article/details/53054538

版权

LeetCode 同时被 3 个专栏收录

334 篇文章 5 订阅

订阅专栏

Leetcode Medium

244 篇文章 0 订阅

订阅专栏

数据结构

129 篇文章 0 订阅

订阅专栏

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.

题目链接：https://leetcode.com/problems/top-k-frequent-elements/

题目分析：O(n)可以用桶排，这里直接给出TreeMap和优先队列的做法(主要是mark下java集合的一些用法)

TreeMap：击败85%

getOrDefault是Java 8的新方法

public class Solution {
    public List<Integer> topKFrequent(int[] nums, int k) {
        HashMap<Integer, Integer> mp = new HashMap<>();
        for (int val: nums) {
            mp.put(val, mp.getOrDefault(val, 0) + 1);
        }
        TreeMap<Integer, List<Integer>> freqMap = new TreeMap<>();
        for (int val: mp.keySet()) {
            int cur = mp.get(val);
            if (!freqMap.containsKey(cur)) {
                freqMap.put(cur, new ArrayList<>());
            }
            freqMap.get(cur).add(val);
        }
        List<Integer> ans = new ArrayList<>();
        while (ans.size() < k) {
            Map.Entry<Integer, List<Integer>> entry = freqMap.pollLastEntry();
            ans.addAll(entry.getValue());
        }
        return ans;
    }
}

优先队列：击败18%

public class Solution {
    public List<Integer> topKFrequent(int[] nums, int k) {
        HashMap<Integer, Integer> mp = new HashMap<>();
        for (int val: nums) {
            mp.put(val, mp.getOrDefault(val, 0) + 1);
        }
        PriorityQueue<Map.Entry<Integer, Integer>> q = new PriorityQueue<>((a, b) -> (b.getValue() - a.getValue()));
        for (Map.Entry<Integer, Integer> entry : mp.entrySet()) {
            q.add(entry);
        }
        List<Integer> ans = new ArrayList<>();
        while (ans.size() < k) {
            Map.Entry<Integer, Integer> entry = q.poll();
            ans.add(entry.getKey());
        }
        return ans;
    }
}