Merge branch 'main' of https://github.com/ayleeee/leetcode-study

Author: ayleeee

top-k-frequent-elements/ayleeee.py

@@ -7,4 +7,5 @@ def topKFrequent(self, nums: List[int], k: int) -> List[int]:
             else:
                 dict_map[a] = 1
         lst = sorted(dict_map.items(), key=lambda x: x[1], reverse=True)  # 공백 수정
-        return [item[0] for item in lst[0:k]]
+        return [item[0] for item in lst[0:k]]
+