We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 11e43f8 commit 11b4bc5Copy full SHA for 11b4bc5
top-k-frequent-elements/gwbaik9717.js
@@ -0,0 +1,24 @@
1
+// Time complexity: O(nlogn)
2
+// Space complexity: O(n)
3
+
4
+/**
5
+ * @param {number[]} nums
6
+ * @param {number} k
7
+ * @return {number[]}
8
+ */
9
+var topKFrequent = function (nums, k) {
10
+ const frequencyDict = new Map();
11
12
+ for (const num of nums) {
13
+ if (frequencyDict.has(num)) {
14
+ frequencyDict.set(num, frequencyDict.get(num) + 1);
15
+ } else {
16
+ frequencyDict.set(num, 1);
17
+ }
18
19
20
+ const entries = [...frequencyDict.entries()];
21
+ entries.sort((a, b) => b[1] - a[1]);
22
23
+ return entries.slice(0, k).map((entry) => entry[0]);
24
+};
0 commit comments