一、思路:
讲数据用map存储,加快查询速度
vector<int> twoSum(vector<int>& nums, int target) {
map<int, int> numsMap;
for (int i = 0; i < nums.size(); i++) {
numsMap.insert(pair<int, int>(nums[i], i));
}
vector<int>res;
for (int i = 0; i < nums.size(); i++) {
auto iter = numsMap.find(target - nums[i]);
if (iter != numsMap.end() && iter->second != i) {
res.push_back(i);
res.push_back(iter->second);
return res;
}
}
return res;
}