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

代码：

#include <iostream>
#include <vector>
using namespace std;
int solution(vector<int> nums,int target)
{
	for(int i=0;i < nums.size();i++)
	{
		for(int j=i;j < nums.size();j++)
		{
			if(nums[i]+nums[j]==target && nums[i] != nums[j])
				cout << "[" << i << "," << j << "]" << endl;
		}
	}
	return 0;
}
int main()
{
	vector<int> num;
	int value;
	while(cin >> value)
	{
		num.push_back(value);
		if(value == 0)
			break;
	}
	int target;
	cin >> target;
	solution(num,target);
}