public class Solution {
public int[] twoSum(int[] numbers, int target) {
int[] res = new int[2];
int i = 0;
int j = numbers.length - 1;
while(i < j){
int temp = numbers[i] + numbers[j];
if( temp == target){
res[0] = i + 1;
res[1] = j + 1;
return res;
}
else if( temp < target){
i++;
} else{
j--;
}
}
return res;
}
}