Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number.
The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.
You may assume that each input would have exactly one solution and you may not use the same element twice.
Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2
題意：給我們一個有序的數(shù)組入客，同時給了一個數(shù)字忿危，讓我們找出數(shù)組中哪兩個數(shù)的下標(biāo)加一起是這個合呐籽。
java代碼：
public int[] twoSum(int[] numbers, int target) {
int[] result = new int[2];
int i = 0;
int j = numbers.length - 1;
int temp;
while (i <= j) {
temp = numbers[i] + numbers[j];
if (temp < target) {
i++;
} else if (temp > target) {
j--;
} else {
result[0] = i + 1;
result[1] = j + 1;
return result;
}
}
return result;
}
