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].
给出一数组与一个目标值,数组中存在唯一一对元素,他们的和为目标值,求出这两个元素的下标。
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
// 使用映射时,若与顺序无关,使用unordered_map,其查找效率更快
unordered_map<int,int>mp;
vector<int>vec;
for(int i=0;i<nums.size();i++){
// 求出该元素应相加的元素 判断是否已经出现即可。
// 注意这里时返回的下标!!!
int tmp=target-nums[i];
if(mp.count(tmp)){
vec.push_back(mp[tmp]);
vec.push_back(i);
return vec;
}
mp[nums[i]]=i;
}
return {};
}
};