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].
题目要求
给定一个数字和一个目标数字,求出数组中两个数字之和等于给定的目标数字。
注意:假定每个数组中有且只有一组解,不能使用同一个数组元素两次
例如:数组[2,7,11,15], 目标数字9,因为nums[0] + nums[1] = 9,所以返回[0,1]
思路分析
1.双层循环遍历整个数组
时间O(n^2)
空间O(1)
2.建立 map
时间O(n)
空间O(n)
代码实现1 C++
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
vector<int> ans;
for (int i=0;i<nums.size();i++)
for (int j=i+1;j<nums.size();j++)
{
if(nums[i]+nums[j]==target)
{
ans.push_back(i);
ans.push_back(j);
return ans;
}
}
}
};
代码实现2 C++
注意: 由于会出现重复数字,所以先进行条件的判断,然后将添加到map中
如:[3,3] 6
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
vector<int> ans;
unordered_map<int,int> m;
for (int i=0;i<nums.size();i++)
{
if (m.count(target-nums[i]))
{
ans.push_back(m[target-nums[i]]);
ans.push_back(i);
break;
}
m[nums[i]]=i;
}
return ans;
}
};