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].
and the solution as follow:
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
map<int,int> targetx;
vector<int> result;
for(int i = 0;i<nums.size();++i){
targetx[nums[i]]=i;
}
for(int j = 0;j<nums.size();++j){
int minus = target - nums[j];
if(targetx.count(minus) && targetx[minus]!=j){
result.push_back(min(j,targetx[minus]));
result.push_back(max(j,targetx[minus]));
return result;
}
}
}
};