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].
首先想到的是暴力解法,自然想到先排序再遍历,O(logn)的复杂度。如果使用map,可以达到O(n)的复杂度。
题目中已经说恰好存在一组解;从头到尾遍历数据,将数字存到map中,key为nums[i],value为对应的下标i,假设遍历到m,map中存在target - n,输出二者的序号就ok。
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
map<int, int> used;
vector<int> ans;
for(int i=0;i<nums.size();i++){
if(used.count(target - nums[i])){
ans.push_back(used[target - nums[i]]);
ans.push_back(i);
return ans;
}else{
used[nums[i]] = i;
}
}
}
};