class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
vector<int> out;
map<int,int> nummap;
for(int i=0;i<nums.size();i++){
if(!nummap.count(nums[i]))
nummap.insert(pair<int,int>(nums[i],i));
if(nummap.count(target-nums[i])&&nummap[target-nums[i]]!=i){
out.push_back(nummap[target-nums[i]]+1);
out.push_back(i+1);
return out;
}
}
return out;
}
};
Two Sum
最新推荐文章于 2024-04-07 20:30:43 发布