原题如下:
Given an array of integers, 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.
Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2
vector<int> twoSum1(vector<int> &numbers, int target) {
int len = numbers.size();
vector<int>v(2,-1);
for(int i = 0; i < len - 1; i++){
for(int j = i + 1; j < len; j++){
if(numbers[i] + numbers[j] == target){
v[0] = i + 1;
v[1] = j + 1;
return v;
}
}
}
}
然后是将原数组中的元素复制一份,然后对复制后的数组进行排序,从排序数组中找到两个元素(前后两个指针查找)后再到原数组中找下标,这里需要注意的是数组中可能存在重复元素,所以当单独需找时需要一个从前往后遍历查找,一个从后往前遍历查找(当然也可以一次遍历寻找两个元素),这种算法的时间复杂度是排序的时间复杂度O(n*logn)。
vector<int> twoSum(vector<int> &numbers, int target) {
vector<int>v = numbers;
vector<int>result(2,0);
sort(v.begin(),v.end());
int i = 0, j = v.size() -1;
while(i < j){
if(v[i] + v[j] == target){
int m = search1(numbers,v[i]);
int n = search2(numbers,v[j]);
result[0] = min(m,n);
result[1] = max(m,n);
return result;
}
if(v[i] + v[j] < target)
i++;
else
j--;
}
}
int search1(vector<int>num,int target){
for(int i = 0; i < num.size(); i++)
if(num[i] == target)
return i + 1;
}
int search2(vector<int>num,int target){
for(int i = num.size() - 1; i >= 0; i--)
if(num[i] == target)
return i + 1;
}
还有一种O(n)的解法,稍后研究下。。。
补(2014.06.11)
这道题的O(n)解法是利用map存储数组中的值和其下标,在遍历数组并将其存入map的过程中,首先判断map中是否存在与当前遍历元素和为target的元素,如果存在则将结果写入vector中并返回,否则将当前元素加入map中继续向后遍历,这里需注意的是遍历的过程中要在将当前元素加入map前进行判断,否则会出现在map中查找到当前元素而可能返回错误结果(例如在{3,2,4}中查找6就会返回1,1的错误)。
vector<int> twoSum(vector<int> &numbers, int target) {
vector<int>v(2,-1);
map<int,int>mp;
for(int i = 0; i < numbers.size(); i++){
int temp = target - numbers[i];
if(mp.find(temp) != mp.end())
{
v[0] = mp[temp] + 1;
v[1] = i + 1;
return v;
}
mp[numbers[i]] = i;
}
}