692. Top K Frequent Words

思路可以和 347. Top K Frequent Elements_Rusian_Stand的博客-CSDN博客一样。

unordered_map + priority_queue

class cmp{public:bool operator()(pair<int,string> a, pair<int,string> b) const{if(a.first < b.first) return true;else if(a.first == b.first && a.second>b.second) return true;return false;}
};class Solution {
public:vector<string> topKFrequent(vector<string>& words, int k) {unordered_map<string,int> ump;for(auto &w : words) ump[w]++;priority_queue<pair<int,string>,vector<pair<int,string>>,cmp> pq;for(auto &m : ump) pq.push({m.second,m.first});vector<string> vec;while(k--){vec.push_back(pq.top().second);pq.pop();}return vec;}
};

692. Top K Frequent Words相关推荐

【LeetCode 剑指offer刷题】查找与排序题12：Top K Frequent Elements
[LeetCode & 剑指offer 刷题笔记]目录(持续更新中...) Top K Frequent Elements Given a non-empty array of integer ...
Leetcode 347. Top K Frequent Elements--python1行解法，Java 11ms解法
题目地址: Given a non-empty array of integers, return the k most frequent elements. Example 1: Input: nu ...
[leetcode]347. Top K Frequent Elements
Given a non-empty array of integers, return the k most frequent elements. For example, Given [1,1,1, ...
Leetcode: Top K Frequent Elements
Given a non-empty array of integers, return the k most frequent elements.For example, Given [1,1,1,2 ...
Leetcode - 347. Top K Frequent Elements(堆排序)
Given a non-empty array of integers, return the k most frequent elements. Example 1: Input: nums = [ ...
leetcode347 - Top K Frequent Elements - medium
Given a non-empty array of integers, return the k most frequent elements. Example 1: Input: nums = [ ...
leetcode 347. Top K Frequent Elements | 347. 前 K 个高频元素（大根堆）
题目 https://leetcode.com/problems/top-k-frequent-elements/ 题解参考:leetcode 215. Kth Largest Element in ...
[swift] LeetCode 347. Top K Frequent Elements
Given a non-empty array of integers, return the k most frequent elements. For example, Given [1,1,1, ...
LeetCode Top K Frequent Elements
题意:给出一个数组,求出前k个出现频率最多的数思路:首先统计每个元素的次数(用Map),然后用堆排序只统计前k个(PriorityQueue) 代码如下: class Solution {class ...
347. Top K Frequent Elements 前 K 个高频元素
给定一个非空的整数数组,返回其中出现频率前 k 高的元素. 示例 1: 输入: nums = [1,1,1,2,2,3], k = 2 输出: [1,2] 示例 2: 输入: nums = [1], ...

692. Top K Frequent Words

692. Top K Frequent Words相关推荐

最新文章

热门文章