Problem:
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
分析:
题目可理解为在无序数组中寻找两数和为target,返回两数下标(题目假设有一个解)。
思路一(Time Limit Exceeded):
可将无序数组进行排序,再使用两指针分别指向头和尾。若和小于sum,头指针+1;若和大于sum,尾指针-1,直至等于sum。
而返回两数下标可建立一个临时数组保存下标。注意:下标从1开始。
时间复杂度:O(nlogn);空间复杂度:O(n)
思路二(Accepted):
tags下提示hashTable方法。
可将数组映射到hashtable到0~target范围内的hashtable中,其中num为键,下标为值(代码采用map)。然后再两两配对查找。
时间复杂度:O(n),空间复杂度:O(n)
AC code(C++):
class Solution {
public:
//16 / 16 test cases passed.
//Runtime: 41 ms
vector<int> twoSum(vector<int> &numbers, int target){
//将数组填入hashMap
map<int, int> hashMap;
for (int i = 0; i < numbers.size(); ++i){
hashMap[numbers[i]] = i + 1;
}
//查找两数
vector<int> result;
for (int i = 0; i < numbers.size(); ++i){
int otherNum = target - numbers[i];
map<int, int>::iterator iter = hashMap.find(otherNum);
if (iter != hashMap.end() && iter->second != i + 1){//存在另一个数,且不为自身
result.push_back(i + 1);
result.push_back(iter->second);
break;
}
}
return result;
}
};
考察hashTable的使用,以时间换空间。