https://leetcode-cn.com/problems/two-sum-ii-input-array-is-sorted/
class Solution {
/*暴力破解
public int[] twoSum(int[] numbers, int target) {
for(int i=0;i<numbers.length-1;i++){
for(int j=i+1;j<numbers.length;j++){
if((numbers[i]+numbers[j])==target){
return new int[]{i+1,j+1};
}
}
}
return new int[]{-1, -1};
}*/
//双指针法
public int[] twoSum(int[] numbers, int target) {
int low=0,high=numbers.length-1;
while(low<=high){
int sum = numbers[low]+numbers[high];
if(sum==target){
return new int[]{low+1,high+1};
}else{
if(sum<target){
low++;
}else{
high--;
}
}
}
return new int[]{-1,1};
}
}