1.两数之和
[LeetCode] 1. Two Sum 两数之和 - Grandyang - 博客园
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 {i, m[target-nums[i]]};
else
m[nums[i]] = i;
}
return {};
}
};