Leetcode HashMap总结

数组中重复的数

class Solution {
    public List<Integer> topKFrequent(int[] nums, int k) {
        HashMap<Integer, Interger> hashMap = new HashMap<Interger, Interger>();
        for(int num: nums){
        	map.put(num, map.getOrDefault(val, 0)+1);
        }
        TreeMap<Interger, List<Interger>> freqMap = new TreeMap<>();
        for(int num: mp.keySet()){
        	int current = mapget(val);
        	if((!freqMap.containKey(cur)){
        		freqMpa.put(cur, new ArrayList<>());
        	}
        }
    }
}