@@ -0,0 +1,367 @@
+// Given a non-empty array of integers, return the k most frequent elements.%0A%0A// For example,%0A// Given %5B1,1,1,2,2,3%5D and k = 2, return %5B1,2%5D.%0A// Given %5B1,1,1,2,2,3%5D and k = 1, return %5B1%5D.%0A%0A// Note:%0A// You may assume k is always valid, 1 %E2%89%A4 k %E2%89%A4 number of unique elements.%0A// Your algorithm's time complexity must be better than O(n log n), where n is the array's size.%0A

add desc