gistfile1.txt

	public int[] topKFrequent(int[] nums, int k) {
		Map<Integer, Integer> valueToCount = new HashMap<>();
		for (int num : nums) {
			int count = valueToCount.getOrDefault(num, 0) + 1;
			valueToCount.put(num, count);
		}

		int pos = 0;
		int[] answer = new int[k];
		PriorityQueue<Integer> pq = new PriorityQueue<>((a,b) ->
				valueToCount.get(b) - valueToCount.get(a));
		pq.addAll(valueToCount.keySet());
		while (k-- > 0)
		{
			answer[pos++] = pq.remove();
		}

		return answer;
	}