Top K Frequent Elements-347

最新推荐文章于 2024-09-16 06:54:08 发布

td092

最新推荐文章于 2024-09-16 06:54:08 发布

阅读量98

点赞数

文章标签： leetcode

欢迎交流，有评论就更

本文链接：https://blog.csdn.net/weixin_38258767/article/details/90680614

版权

347. Top K Frequent Elements

#include <iostream>
#include <vector>
#include <unordered_map>
#include <algorithm>
using namespace std;
class Solution {
public:
	struct node {
		int x, y;
		node(int a, int b) {
			x = a; y = b;
		}
		bool operator<(const node&b)const {
			if (y == b.y)  return  x < b.x;
			return y > b.y;
		}
		bool operator>(const node&b)const {
			if (y == b.y)  return  x > b.x;
			return y < b.y;
		}
	};
	vector<int> topKFrequent(vector<int>& nums, int k) {
		unordered_map<int, int>mp;
		for (int i = 0; i < nums.size(); i++) {
			mp[nums[i]]++;
		}
		vector<node>q;
		for (auto &it : mp) {
			q.push_back(node(it.first, it.second));
		}
		sort(q.begin(),q.end());
		vector<int>ans;
		vector<node>::iterator iter = q.begin();
		for (int i = 0 ; i < k; i++) {
			ans.push_back((*iter++).x);
		}
		return ans;
	}
};

int main() {
	vector<int> nums{ 4,1,-1,2,-1,2,3};
	vector<int> res;

	Solution s1;

	res = s1.topKFrequent(nums, 3);
	vector<int>::iterator iter = res.begin();
	for (; iter != res.end(); iter++) {
		cout << *iter;
	}
	system("pause");
	return 0;
}