1219初始化

Author: superggn

Diff for: array/easy/1-two-sum-2.py

@@ -0,0 +1,21 @@
+"""
+    思路：把遍历过的数据存入缓存，每次查找之前，先在缓存中查找有没有，如果有目标数据，就不用算了。
+"""
+from typing import List
+
+
+class Solution:
+    def twoSum(self, nums: List[int], target: int) -> List[int]:
+        cache = {}
+        for idx, v in enumerate(nums):
+            if v in cache:
+                return [cache[v], idx]
+            remnant = target - v
+            cache[remnant] = idx
+        return None
+
+
+nums = [1, 1, 1, 1, 1, 2, 1, 4, 1, 1]
+s = Solution()
+print(s.twoSum(nums, 9))
+

Diff for: array/easy/1-two-sum.py

@@ -0,0 +1,25 @@
+"""
+    思路：遍历表格，查找符合条件的值
+"""
+
+
+class Solution(object):
+    def twoSum(self, nums, target):
+        """
+        :type nums: List[int]
+        :type target: int
+        :rtype: List[int]
+        """
+        index1 = 0
+        index2 = 0
+        for i in range(0, len(nums) - 1):
+            for j in range(i + 1, len(nums)):
+                if nums[i] + nums[j] == target:
+                    index1 = i
+                    index2 = j
+                    break
+        return [index1, index2]
+
+
+nums = [2, 7, 11, 15]
+s = Solution()