题目
C++ solution
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
vector<int> result;
int len = nums.size();
for(int i = 0; i < len - 1; i++)
{
for(int j = i + 1; j < len; j++)
{
int sum = nums[i] + nums[j];
if(sum == target)
{
result.push_back(i);
result.push_back(j);
return result;
}
}
}
}
};
简要题解
用双重循环遍历数组中任意两个数,判断其和是否等于target,若等于,则返回结果,即这两个数的索引组成的数组;