class Solution {
public:
vector<int> twoSum(vector<int>& price, int target) {
unordered_set<int> s;
int num;
for (auto p:price)
{
num = target-p;
if(s.find(num)!=s.end())
{
return {num,p};
}
s.insert(p);
}
return {};
}
};
leetcode每日一题第103天
最新推荐文章于 2024-07-20 22:34:59 发布