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 1d47595 commit feb2dc0Copy full SHA for feb2dc0
top-k-frequent-elements/Donghae0230.py
@@ -0,0 +1,22 @@
1
+class Solution:
2
+ def topKFrequent(self, nums: List[int], k: int) -> List[int]:
3
+ nums.sort()
4
+ items = {}
5
+ n = nums[0]
6
+ cnt = 1
7
+ if len(nums) > 1:
8
+ for i in range(1, len(nums)):
9
+ if n != nums[i]:
10
+ items[n] = cnt
11
+ n = nums[i]
12
13
+ else:
14
+ cnt += 1
15
16
17
+ items[n] = 1
18
+ sorted_items_desc = sorted(items.items(), key=lambda item: item[1], reverse=True)
19
+ result = []
20
+ for i in sorted_items_desc[:k]:
21
+ result.append(i[0])
22
+ return result
0 commit comments