class Solution {
public:
/*
* @param numbers : An array of Integer
* @param target : target = numbers[index1] + numbers[index2]
* @return : [index1+1, index2+1] (index1 < index2)
*/
vector<int> twoSum(vector<int> &nums, int target)
{
// sort(nums.begin(),nums.end());
int k=nums.size();
int i,j;
bool f=0;
for( i=0;i<k;i++)
{
for( j=i+1;j<k;j++)
if(nums[i]+nums[j]==target)
{ f=1;break;}
if(f==1)
break;
}
vector<int> x;
x.push_back(i+1);
x.push_back(j+1);
return x;
// write your code here
}
};
两数之和
最新推荐文章于 2025-03-31 11:15:14 发布