问题
https://leetcode.com/problems/3sum/
解法《!64ms》
先对数组排序O(nlogn), 然后从前往后枚举第一个数,从后往前枚举第二个数,在第一个数和第二个数之间二分查找第三个数,如果找到就加到结果数组中。枚举复杂度O (n2) , 二分查找复杂度O( logn ), 总体复杂度( n2logn )
class Solution {
public:
vector<vector<int>> threeSum(vector<int>& nums) {
sort(nums.begin(), nums.end());
vector<vector<int>> ret;
for (int i=0; i< nums.size(); i++)
{
if (i-1>=0 && nums[i] == nums[i-1])
continue;
for (int j=nums.size()-1; i+2 <= j; j--)
{
if (j +1 <nums.size() && nums[j] == nums[j+1])
continue;
int v = nums[i]+nums[j];
v*=-1;
if (v < nums[i+1] || nums[j-1] <v)// can not find
continue;
int l = i+1, r = j-1;
int m;
while(l<=r)
{
m = l+(r-l)/2;
if (v < nums[m])
r = m-1;
else if (nums[m] < v)
l = m+1;
else break;
}
if (nums[m] != v)
continue;
vector<int> now;
now.push_back(nums[i]);
now.push_back(nums[m]);
now.push_back(nums[j]);
ret.push_back(now);
}
}
return ret;
}
};
解法二
枚举第一个,tow pointer 后两个
复杂度O(
n2
)
class Solution {
public:
vector<vector<int>> threeSum(vector<int>& nums) {
vector<vector<int>> ret;
vector<int> v(3,0);
sort(nums.begin(), nums.end());
if (nums.size()< 3)
return ret;
for (int i=0; i< nums.size()-2; i++)
{
if (i-1>=0 && nums[i] == nums[i-1])
continue;
int j = i+1;
int k= nums.size() -1;
while(j< k)
{
if ((j-1 > i && nums[j-1] == nums[j]))
{
j++;
continue;
}
if (k+1 != nums.size() && nums[k] == nums[k+1])
{
k--;
continue;
}
int now = nums[i]+nums[j]+nums[k];
if (now == 0)
{
v[0] = nums[i];
v[1] = nums[j];
v[2] = nums[k];
ret.push_back(v);
j++;
k--;
}
else if (now < 0)
j++;
else
k--;
}
}
return ret;
}
};