原题链接:Leecode 1.两数之和
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
map<int,int> hash;
vector<int> res;
for(int i=0;i<nums.size();i++)
{
if(hash[nums[i]])
{
res.push_back(hash[nums[i]]-1);
res.push_back(i);
break;
}
hash[target-nums[i]]=i+1;
}
return res;
}
};