feat: update solutions to leetcode problem: No.0167

Author: yanglbme

solution/0100-0199/0167.Two Sum II - Input array is sorted/README.md

@@ -26,22 +26,71 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+双指针解决。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def twoSum(self, numbers: List[int], target: int) -> List[int]:
+        low, high = 0, len(numbers) - 1
+        while low <= high:
+            if numbers[low] + numbers[high] == target:
+                return [low + 1, high + 1]
+            if numbers[low] + numbers[high] < target:
+                low += 1
+            else:
+                high -= 1
+        return [-1, -1]
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public int[] twoSum(int[] numbers, int target) {
+        int low = 0, high = numbers.length - 1;
+        while (low <= high) {
+            if (numbers[low] + numbers[high] == target) {
+                return new int[]{low + 1, high + 1};
+            }
+            if (numbers[low] + numbers[high] < target) {
+                ++low;
+            } else {
+                --high;
+            }
+        }
+        return new int[]{-1, -1};
+    }
+}
+```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    vector<int> twoSum(vector<int>& numbers, int target) {
+        int low = 0, high = numbers.size() - 1;
+        while (low <= high) {
+            if (numbers[low] + numbers[high] == target) {
+                return {low + 1, high + 1};
+            }
+            if (numbers[low] + numbers[high] < target) {
+                ++low;
+            } else {
+                --high;
+            }
+        }
+        return {-1, -1};
+    }
+};
 ```
 
 ### **...**

solution/0100-0199/0167.Two Sum II - Input array is sorted/README_EN.md

@@ -32,13 +32,60 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def twoSum(self, numbers: List[int], target: int) -> List[int]:
+        low, high = 0, len(numbers) - 1
+        while low <= high:
+            if numbers[low] + numbers[high] == target:
+                return [low + 1, high + 1]
+            if numbers[low] + numbers[high] < target:
+                low += 1
+            else:
+                high -= 1
+        return [-1, -1]
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public int[] twoSum(int[] numbers, int target) {
+        int low = 0, high = numbers.length - 1;
+        while (low <= high) {
+            if (numbers[low] + numbers[high] == target) {
+                return new int[]{low + 1, high + 1};
+            }
+            if (numbers[low] + numbers[high] < target) {
+                ++low;
+            } else {
+                --high;
+            }
+        }
+        return new int[]{-1, -1};
+    }
+}
+```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    vector<int> twoSum(vector<int>& numbers, int target) {
+        int low = 0, high = numbers.size() - 1;
+        while (low <= high) {
+            if (numbers[low] + numbers[high] == target) {
+                return {low + 1, high + 1};
+            }
+            if (numbers[low] + numbers[high] < target) {
+                ++low;
+            } else {
+                --high;
+            }
+        }
+        return {-1, -1};
+    }
+};
 ```
 
 ### **...**

solution/0100-0199/0167.Two Sum II - Input array is sorted/Solution.cpp

@@ -1,39 +1,17 @@
-// 先看target是否是偶数，
-// 偶数的话先排除numbers[i] == numbers[i+1] == target/2
-// 然后set查找
-// 存在的话 再折半查找定位
-class Solution {
+class Solution {
 public:
     vector<int> twoSum(vector<int>& numbers, int target) {
-        set<int> s(numbers.begin(), numbers.end()) ;
-        
-        int t = target ;
-        if (!(target & 1))
-            t /= 2 ;
-        
-        for (int i = 0; i < numbers.size()-1; ++i)
-        {
-            if (numbers[i] == t && numbers[i] == numbers[i+1])
-                return {i+1, i+2} ;
-            
-            int tar = target - numbers[i] ;
-            if (s.find(tar) != s.end())
-            {
-                int l = i+1, r = numbers.size(), mid ;
-                while (l < r)
-                {
-                    mid = (l+r) >> 1 ;
-                    if (numbers[mid] > tar)
-                        r = mid ;
-                    else if (numbers[mid] < tar)
-                        l = mid+1 ;
-                    else
-                        break ;
-                }
-                return {i+1, mid+1} ;
+        int low = 0, high = numbers.size() - 1;
+        while (low <= high) {
+            if (numbers[low] + numbers[high] == target) {
+                return {low + 1, high + 1};
+            }
+            if (numbers[low] + numbers[high] < target) {
+                ++low;
+            } else {
+                --high;
             }
         }
-        
-        return {0, 0} ;
+        return {-1, -1};
     }
 };

solution/0100-0199/0167.Two Sum II - Input array is sorted/Solution.java

@@ -1,11 +1,16 @@
 class Solution {
     public int[] twoSum(int[] numbers, int target) {
-        int l = 0, r = numbers.length - 1;
-
-        while(numbers[l]+numbers[r] != target) {
-            while(numbers[l] + numbers[r] > target) r --;
-            while(numbers[l] + numbers[r] < target) l ++;
+        int low = 0, high = numbers.length - 1;
+        while (low <= high) {
+            if (numbers[low] + numbers[high] == target) {
+                return new int[]{low + 1, high + 1};
+            }
+            if (numbers[low] + numbers[high] < target) {
+                ++low;
+            } else {
+                --high;
+            }
         }
-        return new int[] {l + 1, r + 1};
+        return new int[]{-1, -1};
     }
 }

solution/0100-0199/0167.Two Sum II - Input array is sorted/Solution.py

@@ -0,0 +1,11 @@
+class Solution:
+    def twoSum(self, numbers: List[int], target: int) -> List[int]:
+        low, high = 0, len(numbers) - 1
+        while low <= high:
+            if numbers[low] + numbers[high] == target:
+                return [low + 1, high + 1]
+            if numbers[low] + numbers[high] < target:
+                low += 1
+            else:
+                high -= 1
+        return [-1, -1]