方法一:用HASH表,将每个数x依次放入hash表中;然后检查hash表有没有有没有target-x的数,有就输出。
python实现:
class Solution(object):
"""docstring for ClassName"""
def twoSum(self, nums, target):
dict={}
for i in xrange(len(nums)):
x=nums[i]
if target-x in dict:
return (dict[target-x]+1, i+1)
dict[x]=i
C++实现:
class Solution {
public:
vector<int> twoSum(vector<int> &numbers, int target) {
map<int,int>mp;
for(auto i=0;i<numbers.size();i++){
mp[numbers[i]]=i;
}
for(auto i=0;i<numbers.size();i++){
auto j=mp.find(target-numbers[i]);
if(j!=mp.end()){
if(j->second==i)continue;
vector<int>out;
int k=j->second;
out.push_back(k>i?i+1:k+1);
out.push_back(k<i?i+1:k+1);
return out;
}
}
}
};
方法二:先排序,记录排序前的顺序;然后用类似二分查找的办法,找到相应的那个数。复杂度应该是O(nlogn),注意在找target-x的时候从target/2开始查找可以节约一半的时间。
class Solution {
vector<int>res;
public:
vector<int> twoSum(vector<int>& nums, int target) {
int len=nums.size();int right;
vector<int>num2(nums.begin(),nums.end());
sort(num2.begin(),num2.end());
int Mid=Mydisearch(num2,target/2,0,len);
for(int i=0;i<=Mid;i++){
right=Mydisearch(num2,target-num2[i],Mid,len);
if(num2[right]+num2[i]==target){
int j=0;
while(nums[j]!=num2[i])
j++;
res.push_back(j+1);
int k=0;
while(nums[k]!=num2[right])
k++;
if (k==j)
{
k++;
}
while(nums[k]!=num2[right])
k++;
res.push_back(k+1);
sort(res.begin(),res.end());
return res;
}
}
return res;
}
int Mydisearch(vector<int>& nums, int target, int p, int q){
int m = (p + q) /2;
if(nums[m] == target|| m == p)
return m;
else if(nums[m]>target)
return Mydisearch(nums,target,p,m);
else
return Mydisearch(nums,target,m+1,q);
}
};