Two Sum
题目
难度:Easy
Given an array of integers, return indices of the two numbers such that they add up to a specific target.
Example:
Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].
You may assume that each input would have exactly one solution, and you may not use the same element twice.
实现思路
实现用了最简单的循环求解,从前往后遍历每一个数字,对于数组内其他数字都加一下看是否符合题目。由于每个数字只能用一次,不需要每个数字每次都遍历全组。且因为答案唯一,所以设置了一个flag记录是否找到答案,一旦找到答案就退出循环,返回答案。算法的复杂度为 n(n-1)/2 =O(n^2)。
看了一下网上的算法,用hash表来做可以做到O(n)就能实现,学习了。
下面贴一下自己的代码
vector<int> twoSum(vector<int>& nums, int target) {
bool flag = false;
vector<int> answer;
for(int i = 0; i < nums.size(); i++) {
for (int j = i+1; j < nums.size(); j++) {
if (!flag) {
if (nums[i]+nums[j] == target) {
answer.push_back(i);
answer.push_back(j);
flag = true;
}
}
}
if (flag) break;
}
return answer;
}