Time: 3 ms (28.34%), Space: 50 MB (29.33%) - LeetHub

Author: maniezhilan

167-two-sum-ii-input-array-is-sorted/167-two-sum-ii-input-array-is-sorted.java

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