要求:rt
思路:要么排序双指针,要么哈希
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
unordered_map<int,int> m;
for(int i=0;i<nums.size();++i){
if(m.count(target-nums[i]))return{m[target-nums[i]],i};
m[nums[i]]=i;
}
return {};
}
};