feat: update solutions to leetcode problem: No.0001

Author: yanglbme

solution/0000-0099/0001.Two Sum/README.md

@@ -21,22 +21,45 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+用哈希表（字典）存放数组值以及对应的下标。
+
+遍历数组，当发现 `target - nums[i]` 在哈希表中，说明找到了目标值。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def twoSum(self, nums: List[int], target: int) -> List[int]:
+        helper = {}
+        for i, v in enumerate(nums):
+            num = target - v
+            if num in helper:
+                return [helper[num], i]
+            helper[v] = i
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public int[] twoSum(int[] nums, int target) {
+        Map<Integer, Integer> map = new HashMap<>();
+        for (int i = 0, n = nums.length; i < n; ++i) {
+            int num = target - nums[i];
+            if (map.containsKey(num)) {
+                return new int[]{map.get(num), i};
+            }
+            map.put(nums[i], i);
+        }
+        return null;
+    }
+}
 ```
 
 ### **...**

solution/0000-0099/0001.Two Sum/README_EN.md

@@ -29,13 +29,32 @@ return [<strong>0</strong>, <strong>1</strong>].
 ### **Python3**
 
 ```python
-
+class Solution:
+    def twoSum(self, nums: List[int], target: int) -> List[int]:
+        helper = {}
+        for i, v in enumerate(nums):
+            num = target - v
+            if num in helper:
+                return [helper[num], i]
+            helper[v] = i
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public int[] twoSum(int[] nums, int target) {
+        Map<Integer, Integer> map = new HashMap<>();
+        for (int i = 0, n = nums.length; i < n; ++i) {
+            int num = target - nums[i];
+            if (map.containsKey(num)) {
+                return new int[]{map.get(num), i};
+            }
+            map.put(nums[i], i);
+        }
+        return null;
+    }
+}
 ```
 
 ### **...**

solution/0000-0099/0001.Two Sum/Solution.java

@@ -1,9 +1,10 @@
 class Solution {
     public int[] twoSum(int[] nums, int target) {
         Map<Integer, Integer> map = new HashMap<>();
-        for (int i = 0; i < nums.length; ++i) {
-            if (map.containsKey(target - nums[i])) {
-                return new int[] {map.get(target - nums[i]), i};
+        for (int i = 0, n = nums.length; i < n; ++i) {
+            int num = target - nums[i];
+            if (map.containsKey(num)) {
+                return new int[]{map.get(num), i};
             }
             map.put(nums[i], i);
         }

solution/0000-0099/0001.Two Sum/Solution.py

@@ -1,14 +1,8 @@
 class Solution:
-    def twoSum(self, nums, target):
-        """
-        :type nums: List[int]
-        :type target: int
-        :rtype: List[int]
-        """
-        tmp={k:v for k,v in enumerate(nums)}
-        for k,v in tmp.items():
-            tmp0=tmp.copy()
-            tmp0.pop(k) 
-            if target-v in tmp0.values():
-                return [k,list(tmp0.keys())[list(tmp0.values()).index(target-v)]]
-        return []
+    def twoSum(self, nums: List[int], target: int) -> List[int]:
+        helper = {}
+        for i, v in enumerate(nums):
+            num = target - v
+            if num in helper:
+                return [helper[num], i]
+            helper[v] = i