[ayleeee] WEEK 01 solutions

contains-duplicate/ayleeee.py

@@ -0,0 +1,4 @@
+class Solution:
+    def containsDuplicate(self, nums: List[int]) -> bool:
+        return len(set(nums))!=len(nums)
+

top-k-frequent-elements/ayleeee.py

@@ -0,0 +1,11 @@
+class Solution:
+    def topKFrequent(self, nums: List[int], k: int) -> List[int]:
+        dict_map = {}
+        for a in nums:
+            if a in dict_map:
+                dict_map[a] += 1
+            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]]
+

two-sum/ayleeee.py

@@ -0,0 +1,6 @@
+class Solution:
+    def twoSum(self, nums: List[int], target: int) -> List[int]:
+        for a in range(len(nums)):
+            for b in range(a+1,len(nums)):
+                if nums[a]+nums[b]==target:
+                    return [a,b]