题目链接:https://leetcode-cn.com/problems/two-sum-ii-input-array-is-sorted/
题目如下:
class Solution {
public int[] twoSum(int[] numbers, int target) {
int pos1=0,pos2=numbers.length-1,sum=0;
int[] pos=new int[2];
while(pos1<pos2){
sum=numbers[pos1]+numbers[pos2];
if(sum>target) pos2--;
else if(sum<target) pos1++;
else break;
}
pos[0]=pos1+1;pos[1]=pos2+1;
return pos;
}
}