题目
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
翻译:
给一个已经按升序排列好的整数数组,找到两个数字,使得它们加起来达到特定的目标数。函数twoSum应该返回两个数字的索引,使得它们加到目标,其中index1必须小于index2。 请注意,您返回的答案(index1和index2)不是基于零的。
您可以假设每个输入只有一个解决方案,您不能使用相同的元素两次。
输入:numbers = {2,7,11,15},target = 9
输出:index1 = 1,index2 = 2
解答:
#include<iostream>
#include<vector>
using namespace std;
最简单的思路:全部遍历
//vector<int> twoSum(vector<int>& numbers, int target) {
// vector<int> a;
// int n = numbers.size();
// for (int i = 0; i < n; i++)
// {
// for (int j = i + 1; numbers[j] <= numbers[n - 1]; j++)
// {
// if (numbers[i] + numbers[j] == target)
// {
// a.push_back(i + 1);
// a.push_back(j + 1);
// return a;
// }
// }
// }
//}//双重循环,运算正确,但是超时了
既然双重循环不行,那我就试试单循环
//vector<int> twoSum(vector<int>& numbers, int target) {
// vector<int> a;
// int n = numbers.size();
// int j = n - 1;
// for (int i = 0; i < n; i++)
// {
//
// if (numbers[i] + numbers[j] == target)
// {
// a.push_back(i + 1);
// a.push_back(j + 1);
// return a;
// }
// j--;
// }
//}//错在i和j同步增减,eg:[0,0,3,4]0
vector<int> twoSum(vector<int>& numbers, int target) {
vector<int> a;
int n = numbers.size();
int i = 0;//设置前指针
int j = n - 1;//设置后指针
while (i < j)//当两个指针还没有碰面
{
int s = numbers[i] + numbers[j];
if (s == target)//一遇到相等就返回,题目只要求返回一组答案
{
a.push_back(i + 1);
a.push_back(j + 1);
return a;
}
else if (s < target)//说明前面那个数不够大
{
i++;
}
else//(s>target)说明后面的数过大了
j--;
}
}
感悟:
还是too young,too simple…
有时候设置两个指针,一前一后,进度倍增,并且要巧妙设置两指针前进顺序