【题目描述】:
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].
【思路】:
由于限定了一定会有解,而且由两个组成,我直接使用的遍历
【C++代码】:
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
int count = nums.size();
for (int i = 0; i < count; ++i) {
for (int j = i + 1; j < count; ++j) {
if (nums[i] + nums[j] == target) {
vector<int> vInts;
vInts.push_back(i);
vInts.push_back(j);
return vInts;
}
}
}
}
};