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>& nums, int target) {
for (int i = 0; i < nums.size(); i++) {
for (int j = i+1; j < nums.size(); j++) {
if (nums[i]+nums[j] == target) {
vector<int> a;
a.push_back(i);
a.push_back(j);
return a;
}
}
}
}
};