leetcode 692. Top K Frequent Words

最新推荐文章于 2022-10-19 17:45:00 发布

暴躁的猴子

最新推荐文章于 2022-10-19 17:45:00 发布

阅读量143

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/orangefly0214/article/details/93543683

版权

leetcode 专栏收录该内容

85 篇文章 1 订阅

订阅专栏

题目描述

Given a non-empty list of words, return the k most frequent elements.

Your answer should be sorted by frequency from highest to lowest. If two words have the same frequency, then the word with the lower alphabetical order comes first.

Example 1:

Input: ["i", "love", "leetcode", "i", "love", "coding"], k = 2
Output: ["i", "love"]
Explanation: "i" and "love" are the two most frequent words.
    Note that "i" comes before "love" due to a lower alphabetical order.

Example 2:

Input: ["the", "day", "is", "sunny", "the", "the", "the", "sunny", "is", "is"], k = 4
Output: ["the", "is", "sunny", "day"]
Explanation: "the", "is", "sunny" and "day" are the four most frequent words,
    with the number of occurrence being 4, 3, 2 and 1 respectively.

Note:

You may assume k is always valid, 1 ≤ k ≤ number of unique elements.
Input words contain only lowercase letters.

Follow up:

Try to solve it in O(n log k) time and O(n) extra space.

思路：

同347 https://blog.csdn.net/orangefly0214/article/details/93034018

实现1：最小堆

//采用最小堆
    public List<String> topKFrequent(String[] words, int k) {
        List<String> ret=new LinkedList<>();
        Map<String,Integer> map=new HashMap<>();
        for(String str:words){
            map.put(str,map.getOrDefault(str,0)+1);
        }
        //声明一个最小堆
        PriorityQueue<Map.Entry<String, Integer>> pq = new PriorityQueue<>(
                (a,b) -> a.getValue()==b.getValue() ? b.getKey().compareTo(a.getKey()) : a.getValue()-b.getValue()
        );
        //在最小堆中保留出现频率最高的2个数
        for (Map.Entry<String,Integer> entry:
             map.entrySet()) {
             pq.offer(entry);
             if(pq.size()>k){
                 pq.poll();
             }
        }
        while(!pq.isEmpty()){
            ret.add(0,pq.poll().getKey());
        }
        return ret;
    }

实现2：桶排序

//采用桶排序
    public List<String> topKFrequent2(String[] words, int k) {
        HashMap<String,Integer> map=new HashMap<>();
        int max=0;
        for (String w:words) {
            map.put(w,map.getOrDefault(w,0)+1);
            max=Math.max(max,map.get(w));
        }
        List<String>[] bucket=new ArrayList[max+1];
        for(Map.Entry<String,Integer> entry:map.entrySet()){
            int fre=entry.getValue();
            if(bucket[fre]==null){
                bucket[fre]=new ArrayList<>();
            }
            bucket[fre].add(entry.getKey());
        }
        List<String> res=new ArrayList<>();
        for (int i = max; i>=0&&res.size()<k; i--) {
            if(bucket[i]!=null){
                Collections.sort(bucket[i]);
                res.addAll(bucket[i]);
            }
        }
        return res.subList(0,k);//返回列表中指定的 fromIndex（包括 ）和 toIndex（不包括）之间的部分视图。
    }