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].
UPDATE (2016/2/13):
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].
UPDATE (2016/2/13):
The return format had been changed to zero-based indices. Please read the above updated description carefully.
给定一个目标数值,在一个数组中求是否存在两个数相加的和等于给定值。
方法一:使用c++中的map结构。第一遍遍历的时候保存nums[i]和i的键值对的关系,然后再遍历一遍整个数组,对于每一个nums[i]获取target-nums[i]的值,判断下差是否在数组中,使用map的寻找的时间复杂度为O(lgn).
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
//边界条件 当数组的个数少于2个时 不符合题目条件
vector<int>res;
if(nums.size()<2)
return res;
map<int,int>record;
for(int i=0;i<nums.size();i++)
{
record[nums[i]]=i;
}
for(int i=0;i<nums.size();i++)
{
int searchNum=target-nums[i];
if(record.find(searchNum)!=record.end())
{
if(record[searchNum]!=i) //注意判断下这个差值不能是自己本身即可
{
res.push_back(i);
res.push_back(record[searchNum]);
break;
}
}
}
return res;
}
};
运行时间28ms
方法二:可以先复制一份数组的内容用于排序操作。对于一个有序的数组,从首位两端开始求和sum=nums[start]+nums[end]。如果sum>target,则end--;sum<target,则start++。当两者相等的时候需要确认在原数组中的位置下标,存下来返回即可
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
vector<int>res;
if(nums.size()<2)
return res;
vector<int>temp(nums); //复制一份 用来排序 而后两端一起搜索
sort(temp.begin(),temp.end());
int start=0,end=nums.size()-1;
while(start<end)
{
int sum=temp[start]+temp[end];
if(sum==target)
{
int flag=0;
for(int i=0;i<nums.size()&&flag<2;i++)
{
if(nums[i]==temp[start]||nums[i]==temp[end])
{
flag++;
res.push_back(i);
}
}
break;
}
else if(sum<target)
start++;
else
end--;
}
return res;
}
};
运行时间12ms