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 def85b8 commit 05e860eCopy full SHA for 05e860e
top-k-frequent-elements/jiji-hoon96.ts
@@ -12,22 +12,13 @@
12
*/
13
14
function topKFrequent(nums: number[], k: number): number[] {
15
- let result = []
16
const countObject: { [key: number]: number } = {};
17
18
for(const num of nums){
19
- countObject[num] = (countObject[num] || 0) +1;
+ countObject[num] = (countObject[num] || 0) + 1;
20
}
21
22
- const sortObject= Object.entries(countObject).sort((a,b) => b[1]- a[1]);
+ const sortObject = Object.entries(countObject).sort((a,b) => b[1] - a[1]);
23
24
- for(const [key] of sortObject){
25
- if(k>0){
26
- result.push(Number(key))
27
- k--;
28
- }
29
-
30
31
32
- return result
+ return sortObject.slice(0, k).map(([key]) => Number(key));
33
};
0 commit comments