前K个高频元素

class Solution {
public static class Node {
int num;
int count;
public Node(int num,int count) {
this.num = num;
this.count = count;
}
}
public int[] topKFrequent(int[] nums, int k) {
if (k > nums.length)
return null;
HashMap map = new HashMap<>();
for (int num : nums){
if (map

前K个高频元素最先出现在Python成神之路。