Question:
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].
Solution1:
思路分析:
简单粗暴的方法就是通过两个for循环,找到数组中的两个不同数的和等于target,注意这里第二个for循环的变量j从i+1开始遍历,时间复杂度:O(n^2),其中n表示nums容器的大小。代码实现:
#include <vector.h>
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
vector<int> result;
for(int i = 0; i < nums.size()-1; i++) {
for (int j = i+1; j <nums.size(); j++) {
if (nums[i] + nums[j] == target) {
result.push_back(i);
result.push_back(j);
return result;
}
}
}
}
};
Solution2:
- 思路分析:
参考本题Solution模块的解答,又考虑到STL中没有C++的hash_map容器,所以选择用map容器降低时间复杂度:对于nums容器的每个元素,find()函数查找map是否存在其互补的元素,是的话输出数对的下标,否则将此元素放入map容器,这样子,时间复杂度仅仅为O(n)。 - 代码实现:
class Solution {
public:
vector<int> twoSum(vector<int> &nums, int target) {
map<int, int> map;
for (int i = 0; i < nums.size(); i++) {
int complement = target - nums[i];
//找到map中key==complement的value值
int pos = map.find(complement);
if (pos != mapping.end()) {
vector<int> result;
result.push_back(map[complement]);
result.push_back(i);
return result;
}
map[nums[i]] = i;
}
}
};