数组中两数相加Two Sum

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].

/*
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].
 */

#include<iostream>
using namespace std;
#include<vector>;

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        vector<int> v;
        for(int i=nums.size()-1; i>0; i--)
        	for(int j=0; j<i; j++)
        		if(nums[i] + nums[j] == target)
        		{
        			v.push_back(j);
        			v.push_back(i);
        		}
        return v;
    }
};

int main(){
	vector<int> v;
	v.push_back(2);
	v.push_back(7);
	v.push_back(11);
	v.push_back(15);
	int target = 9;

	Solution s;
	vector<int> result = s.twoSum(v,target);
	for(int i=0; i<result.size(); i++)
		cout<<result[i];

	return 0;
}