leetcode1. Two Sum
Problem:
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].
Solution1:
时间复杂度O(1)
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
unordered_map<int,int>m;
for(int i=0;i<nums.size();++i){
if(m.find(target-nums[i])!=m.end()){
return vector<int>{m[target-nums[i]],i};
}
m[nums[i]]=i;
}
return vector<int>();
}
};
Solution2:
时间复杂度O(n2)
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
vector<int> res;
for(int i=0; i<nums.size()-1;i++)
for(int j=i+1;j<nums.size();j++)
if(nums[i]+nums[j]==target){
res.push_back(i);
res.push_back(j);
break;
}
return res;
}
};