版权声明：文章都是原创，转载请注明~~~~ https://blog.csdn.net/SourDumplings/article/details/86529462
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].
输入：
[3,2,4]6输出：
[1,2]C++:
/*
@Date : 2018-01-05 13:18:10
@Author : 酸饺子 ([email protected])
@Link : https://github.com/SourDumplings
@Version : $Id$
*/
/*
https://leetcode.com/problems/two-sum/description/
*/
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target)
{
for(int i = 0; i != nums.size(); ++i)
{
for(int j = i + 1; j != nums.size(); ++j)
{
if(nums[i] + nums[j] == target)
return *(new vector<int>{i, j});
}
}
}
};