Update 0167-Two-Sum-II-Input-array-is-sorted.md

0167-Two-Sum-II-Input-array-is-sorted/Article/0167-Two-Sum-II-Input-array-is-sorted.md

@@ -48,20 +48,27 @@
 class Solution {
 public:
     vector<int> twoSum(vector<int>& numbers, int target) {
-        int l = 0, r = numbers.size() - 1;
-        while(l < r){
-            if(numbers[l] + numbers[r] == target){
-                int res[2] = {l+1, r+1};
-                return vector<int>(res, res+2);
+        int n = numbers.size();
+        int left = 0;
+        int right = n-1;
+        while(left <= right)
+        {
+            if(numbers[left] + numbers[right] == target)
+            {
+                return {left + 1, right + 1};
+            }
+            else if (numbers[left] + numbers[right] > target)
+            {
+                right--;
+            }
+            else
+            {
+                left++;
             }
-            else if(numbers[l] + numbers[r] < target)
-                l ++;
-            else // numbers[l] + numbers[r] > target
-                r --;
         }
+        return {-1, -1};
     }
-
-
+};
 ```
 #### Java
 ```java