167. Two Sum II - Input array is sorted
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
第一反应还是愚蠢的遍历(可怕,做题不够)。遍历两遍,测试案例全部通过但是运行时间超过限制。
查了一下,发现原来是经典的双指针问题,依据这个思路:
class Solution {
public:
vector<int> twoSum(vector<int>& numbers, int target) {
vector<int> index;
int i=0, j=numbers.size()-1;
while(i<j)
{
if(numbers[i]+numbers[j]<target)
i++;
else if(numbers[i]+numbers[j]>target)
j--;
else
{
index.push_back(i+1);
index.push_back(j+1);
break;
}
}
return index;
}
};