class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target)
{
vector<int> res(2,-1);
if (!nums.empty())
{
unordered_map<int, int> m;
for(int i = 0; i < nums.size(); ++i)
{
if (m.find(target - nums[i]) == m.end())
{
m[nums[i]] = i;
}
else
{
res[0] = m[target - nums[i]]+1;
res[1] = i+1;
}
}
}
return res;
}
};
Two Sum
最新推荐文章于 2024-04-07 20:30:43 发布