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].
问题描述:给定一个正整数数组,若其中两个数相加等于特定的书(target),则返回相应的下标(indices)。并且假设输入中有且仅有一个解,每个元素只能使用一次。
解题思路:问题比较简单,可以通过穷举法完成,遍历数组中所有两个变量,若相加结果为target,则记录下标并返回结果。
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
vector<int> a(2, 0);
for(int i=0; i<nums.size();i++){
for(int j=i+1; j<nums.size();j++){
if(nums[j] == target - nums[i]){
a[0] = i;
a[1] = j;
return a;
}
}
}
}
};