@add: leetcode problem 1

MovingToWeb · MovingToWeb · commit 9117b005459c · 2020-04-06T20:14:43.000+05:30
diff --git a/leetcode/Solution.py b/leetcode/Solution.py
@@ -7,4 +7,11 @@ def twoSum(self, nums: List[int], target: int) -> List[int]:
                     sumOf=nums[j] + nums[i]
                     if (sumOf == target):
                         return j, i
-# Enumeration is faster than this
+# Enumeration is faster than this
+#     def twoSum(self, nums, target):
+#         a ={}
+#         for i, num in enumerate(nums):
+#             if target-num in a:
+#                 return [a[target - num], i]
+#             else:
+#                 a[num] = i
