1
2
3
4
5
6
7
8
9
10
11
12
13
14
| class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
unordered_map<int, int> map;
for(int i = 0, sz = nums.size(); i < sz; ++i)
{
if(map.count(target - nums[i]))
return {map[target - nums[i]], i};
else
map.emplace(nums[i], i);
}
return {};
}
};
|