题目描述:
Given an array of integers, return indices of the two numbers such that they add up to a specific target.
You may assume that each input would have exactly one solution, and you may not use the same element twice.
Example:
Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].
给定一个整数数组 nums
和一个目标值 target
,请你在该数组中找出和为目标值的那 两个 整数,并返回他们的数组下标。
你可以假设每种输入只会对应一个答案。但是,你不能重复利用这个数组中同样的元素。
示例:
给定 nums = [2, 7, 11, 15], target = 9 因为 nums[0] + nums[1] = 2 + 7 = 9 所以返回 [0, 1]
思路:得到集合中数据两两相加之和,和目标值比较即可,注意不要和自身相加,也不要出现类似1+2和2+1的重复情况。
#include<cstdio>
#include<iostream>
#include<vector>
using namespace std;
vector<int> twoSum(vector<int>& nums, int target)
{
vector<int> result;
//跳出双重循换最外层循环的标志位
int flag = -1;
for(int i=0;i<=nums.size()-2&&flag<0;++i)
{
for(int j=i+1;j<=nums.size()-1;++j)
{
if(nums[i]+nums[j]==target)
{
result.push_back(i);
result.push_back(j);
flag += 1;
break;
}
}
}
return result;
}
int main(){
int a[] = {3,2,4};
vector<int> nums(a,a+3);
int target = 6;
vector<int> result = twoSum(nums,target);
cout<<result.size()<<endl;
for(int i=0;i<2;++i)
printf("%d ",result[i]);
return 0;
}