vector<int> twoSum(vector<int>& nums, int target)
{
vector<int>tempIndex;
for(int i=0;i<nums.size();i++)
{
for (int j=i+1;j<nums.size();j++)
{
if (nums[j]==target-nums[i])
{
tempIndex.push_back(i);
tempIndex.push_back(j);
return tempIndex;
}
}
}
return tempIndex;
}
LeetCode1-两数求和
猜你喜欢
转载自blog.csdn.net/hi_baymax/article/details/81904184
今日推荐
周排行