问题描述:
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].
//时间复杂度o(n^2)
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target)
{
vector<int> res;
if(nums.size() == 0)
return res;
for(int i = 0;i < nums.size();i ++)
{
res.push_back(i);
for(int j = i+1;j < nums.size();j ++)
{
if(nums[i] + nums[j] == target)
{
res.push_back(j);
break;
}
}
if(res.size()==2)
break;
else
res.pop_back();
}
return res;
}
};
//第二种方法,二分法,时间复杂度o(logn)