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

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