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].
蛮力解决:
class Solution {
public:vector<int> twoSum(vector<int> &numbers, int target) {
vector<int> result;
for(int i=0;i<numbers.size();i++){
int a=numbers[i];
int temp=target-a;
if(i!=numbers.size()-1){
for(int j=i+1;j<numbers.size();j++){
if(numbers[j]==temp){
result.push_back(i);
result.push_back(j);
}
}
}
}
return result;
}
};