Skip to content
Merged
Changes from 1 commit
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
16 changes: 16 additions & 0 deletions top-k-frequent-elements/sooooo-an.ts
Original file line number Diff line number Diff line change
@@ -0,0 +1,16 @@
function topKFrequent(nums: number[], k: number): number[] {
const frequentMap = new Map<number, number>();

for (const num of nums) {
frequentMap.set(num, (frequentMap.get(num) ?? 0) + 1);
}

const sorted = Array.from(frequentMap.entries()).sort((a, b) => b[1] - a[1]);
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

저는 전체 정렬을 하게되면 더 오래걸릴 거라고 생각해서 힙 구조를 사용해봤습니다. 이 코드를 보고 찾아보니 모든 상황에서 그런 건 아니네요. 배워갑니다!


return sorted.slice(0, k).map(([key]) => Number(key));
}

/**
* Runtime 9ms / 78.90%
* Memory 60.130MB / 66.67%
*/