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.
Example:
Given nums = [2, 7, 11, 15], target = 9, Because nums[0] + nums[1] = 2 + 7 = 9, return [0, 1].
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
int left, right;
int len = nums.size();
vector<int> vec;
for( left = 0; left < len; left++ ) {
for( right = left + 1; right < len; right++ ) {
if( nums[left] + nums[right] == target ) {
vec.push_back( left );
vec.push_back( right );
break;
}
}
}
return vec;
}
};