fix: rename directory to lc problem: No.0167

No.0167.Two Sum II - Input Array Is Sorted

Author: yanglbme

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

@@ -1,14 +1,14 @@
-class Solution {
-public:
-    vector<int> twoSum(vector<int>& numbers, int target) {
-        int left = 1, right = numbers.size();
-        while (left < right)
-        {
-            int x = numbers[left - 1] + numbers[right - 1];
-            if (x == target) return {left, right};
-            if (x < target) ++left;
-            else --right;
-        }
-        return {-1, -1};
-    }
+class Solution {
+public:
+    vector<int> twoSum(vector<int>& numbers, int target) {
+        int left = 1, right = numbers.size();
+        while (left < right)
+        {
+            int x = numbers[left - 1] + numbers[right - 1];
+            if (x == target) return {left, right};
+            if (x < target) ++left;
+            else --right;
+        }
+        return {-1, -1};
+    }
 };

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

@@ -1,15 +1,15 @@
-func twoSum(numbers []int, target int) []int {
-	i, j := 1, len(numbers)
-	for i < j {
-		x := numbers[i-1] + numbers[j-1]
-		if x == target {
-			return []int{i, j}
-		}
-		if x < target {
-			i++
-		} else {
-			j--
-		}
-	}
-	return []int{-1, -1}
+func twoSum(numbers []int, target int) []int {
+	i, j := 1, len(numbers)
+	for i < j {
+		x := numbers[i-1] + numbers[j-1]
+		if x == target {
+			return []int{i, j}
+		}
+		if x < target {
+			i++
+		} else {
+			j--
+		}
+	}
+	return []int{-1, -1}
 }

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

@@ -1,17 +1,17 @@
-class Solution {
-    public int[] twoSum(int[] numbers, int target) {
-        int i = 1, j = numbers.length;
-        while (i < j) {
-            int x = numbers[i - 1] + numbers[j - 1];
-            if (x == target) {
-                return new int[]{i, j};
-            }
-            if (x < target) {
-                ++i;
-            } else {
-                --j;
-            }
-        }
-        return new int[]{-1, -1};
-    }
+class Solution {
+    public int[] twoSum(int[] numbers, int target) {
+        int i = 1, j = numbers.length;
+        while (i < j) {
+            int x = numbers[i - 1] + numbers[j - 1];
+            if (x == target) {
+                return new int[]{i, j};
+            }
+            if (x < target) {
+                ++i;
+            } else {
+                --j;
+            }
+        }
+        return new int[]{-1, -1};
+    }
 }

solution/0100-0199/0167.Two Sum II - Input array is sorted/Solution.go solution/0100-0199/0167.Two Sum II - Input Array Is Sorted/Solution.go

@@ -1,12 +1,12 @@
-class Solution:
-    def twoSum(self, numbers: List[int], target: int) -> List[int]:
-        i, j = 1, len(numbers)
-        while i < j:
-            x = numbers[i - 1] + numbers[j - 1]
-            if x == target:
-                return [i, j]
-            if x < target:
-                i += 1
-            else:
-                j -= 1
-        return [-1, -1]
+class Solution:
+    def twoSum(self, numbers: List[int], target: int) -> List[int]:
+        i, j = 1, len(numbers)
+        while i < j:
+            x = numbers[i - 1] + numbers[j - 1]
+            if x == target:
+                return [i, j]
+            if x < target:
+                i += 1
+            else:
+                j -= 1
+        return [-1, -1]