在一个有序数列中寻找两个数的值的和，等于目标元素target,返回两个元素的下标。
class Solution {
public int[] twoSum(int[] numbers, int target) {
int low =0;
int 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){
--high;
}else{
++low;
}
}
return new int[]{-1,-1};
}
}
