feat: 1week (#1721)

feat: 1주차 1,2 문제

Author: chordpli

contains-duplicate/chordpli.py

@@ -0,0 +1,12 @@
+from typing import List
+
+class Solution:
+    def containsDuplicate(self, nums: List[int]) -> bool:
+        dic = {}
+
+        for num in nums:
+            if dic.get(num):
+                return True
+            dic[num] = 1
+
+        return False

two-sum/chordpli.py

@@ -0,0 +1,11 @@
+from typing import List
+
+class Solution:
+    def twoSum(self, nums: List[int], target: int) -> List[int]:
+        map = {}
+        for i, num in enumerate(nums):
+            complement = target - num
+            if complement in map:
+                return [map[complement], i]
+
+            map[num] = i