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].
思路:
1.注意题意要求返回indices,所以不能排序在使用two pointers。
2.使用哈希表做即可。
参考代码:
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
vector<int> ans(2);
unordered_map<int,int> mp;
for(int i=0;i<nums.size();i++){
if(mp.find(target-nums[i])!=mp.end()){
ans[0]=min(i,mp[target-nums[i]]);
ans[1]=max(i,mp[target-nums[i]]);
return ans;
}
mp[nums[i]]=i;
}
return ans;
}
};