【问题描述】
Given an array of integers, return indices of the two numbers such that they add up to a specific target. You may assume that each input would have exactly one solution, and you may not use the same element twice.
Example:
Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].
问题来源:Two Sum
【问题解析】
这个问题用两个嵌套循环也能完成,但时间复杂度会是O(n^2),不是一个首选的算法。
考虑使用map<int,int>将遍历后的数和它的下标存放,在一个循环遍历下,利用map的标准库函数find()去寻找满足条件的数,时间复杂度只有O(n)。
【源代码】
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
map<int, int> hash;
vector<int> result;
for (int i=0; i < nums.size(); i++) {
int numberToFind = target - nums[i];
if (hash.find(numberToFind) != hash.end()) {
result.push_back(hash[numberToFind]);
result.push_back(i);
return result;
}
hash[nums[i]] = i;
}
return result;
}
};