167. 两数之和 II - 输入有序数组 - 力扣（LeetCode） (leetcode-cn.com)
class Solution {
//双指针解法
public int[] twoSum(int[] numbers, int target) {
int[] res = new int[2];
int l=0,r=numbers.length-1;
while(l<r){
if(numbers[l]+numbers[r]==target){
res[0] = l+1;
res[1] = r+1;
break;
}else if(numbers[l]+numbers[r]<target){
l++;
}else{
r--;
}
}
return res;
}
}
