简单
注意点:一次遍历就行 ,不要用两次遍历。
vector<int> twoSum(vector<int> &nums, int target) {
unordered_map<int, int> unorderedMap;
vector<int> res(2, -1);
for (int i = 0; i < nums.size(); ++i) {
int a = nums[i];
int need = target - a;
if (unorderedMap.count(need)) {
res[0] = i;
res[1] = unorderedMap[need];
break;
} else {
unorderedMap[a] = i;
}
}
return res;
}