class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
vector<int> res;
for(int i=0;i<nums.size();i++)
{
for(int j=i+1;j<nums.size();j++)
{
if(nums[i]+nums[j]==target)
{
res.push_back(i);
res.push_back(j);
break;
}
}
}
return res;
}
};
LeetCode 1 Two Sum
最新推荐文章于 2022-02-22 21:10:36 发布