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]) != 0) {
return {i,m[target-nums[i]]};
}
m[nums[i]] = i;
}
return {};
}
};
【哈希表】leetcode.1.俩数之和
最新推荐文章于 2022-11-15 22:44:36 发布