Create [Leet Code] 1. Two Sum jamin.py da-in#108

jaminleee · jaminleee · commit 7a9e60dd911c · 2023-03-19T18:16:30.000+09:00
diff --git a/Leet Code/Two Sum/jamin.py b/Leet Code/Two Sum/jamin.py
@@ -0,0 +1,10 @@
+class Solution:
+    def twoSum(self, nums: List[int], target: int) -> List[int]:
+        find = {}
+        for i in range (len(nums)): #0,1,2...
+            for j in range (i+1,len(nums)):
+                if nums[i]+nums[j] == target:
+                    return [i,j]
+                
+
+            
