image_2021-12-10_01-26-42.png
30.4 KB
#N167. Two Sum II - Input Array Is Sorted
problem link
#solution
problem link
#solution
class Solution {
public int[] twoSum(int[] numbers, int target) {
int start = 0, end = numbers.length - 1;
while(start < end){
if(numbers[start] + numbers[end] == target) break;
if(numbers[start] + numbers[end] < target) start++;
else end--;
}
return new int[]{start + 1, end + 1};
}
}