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的初始化就好了。
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
vector<int> indices(2,-1); //记住vector的初始化
int tmp;
int length = nums.size();
for(int i = 0; i < length; i++){
for(int j = i + 1; j < length; j++){
tmp = nums[i] + nums[j];
if(tmp == target){
indices[0] = i;
indices[1] = j;
return indices;
}
}
}
}
};