LeetCode-15. 三数之和

地址：https://leetcode-cn.com/problems/3sum/

思路：一、排序后枚举前两个，再二分查找第三个。

二、排序后枚举中间元素，再利用两指针从两端扫描，对于重复的三元组，需做处理

Code:

#include<iostream>
#include<algorithm>
#include<vector>
#include<cmath>
#include<map>
#include<unordered_map>
#include<cstring>
using namespace std;
typedef long long LL;

/*
class Solution {
public:
    vector<vector<int>> threeSum(vector<int>& nums) {
    	unordered_map<int,int> imap;
        vector<vector<int>> res;
		int n=nums.size(),x,k;
		if(!n)	return res;
		sort(nums.begin(),nums.end());
		for(int i=0;i<n;++i)
			imap[nums[i]]=i+1;
        for(int i=0,x1=nums[0]-1;i<n-2&&nums[i]<=0;x1=nums[i],++i)
        {
        	if(nums[i]==x1)	continue;
			for(int j=i+1,x2=nums[j]-1;j<n-1;x2=nums[j],++j)
			{
				if(nums[j]==x2)	continue;
				x=-(nums[i]+nums[j]);
				if(x<nums[j])	break;
				if(imap[x]&&imap[x]>j+1){
					res.push_back(vector<int>{nums[i],nums[j],x});
				}
			}
		}
        return res;
    }
};
*/

class Solution {
public:
    vector<vector<int>> threeSum(vector<int>& nums) {
        vector<vector<int>> res;
		int n=nums.size(),l,r;
		if(!n)	return res;
		sort(nums.begin(),nums.end());
		if(nums[n-1]<0||nums[0]>0)	return res;
		int k,p=0;
        for(int i=1,x=nums[0];i<n-1;x=nums[i],++i)
        {
            if(nums[i]==x){
            	if(!p){
	            	k=lower_bound(nums.begin()+i+1,nums.end(),-(nums[i]+nums[i]))-nums.begin();
	            	if(k!=n&&nums[k]+nums[i]+nums[i]==0){
	            		res.push_back({nums[i],nums[i],nums[k]});	p=1;
					}
				}
            	continue;
            }
            p=0;
        	l=0;	r=n-1;
        	while(l<i&&r>i){
        		if(nums[l]>0)	break;
        		if(nums[r]<0)	break;
        		if(l>0&&nums[l]==nums[l-1])	++l;
        		else	if(r<n-1&&nums[r]==nums[r+1])	--r;
        		else{
	        		if(nums[l]+nums[i]+nums[r]>0)	--r;
					else	if(nums[l]+nums[i]+nums[r]<0)	++l;
					else{
						res.push_back({nums[l],nums[i],nums[r]});
						++l;	--r;
					}
				}
			}
		}
        return res;
    }
};

int main()
{
	int n,x;
	vector<int> iv;
	Solution So;
	cin>>n;
	for(int i=0;i<n;++i)
	{
		cin>>x;
		iv.push_back(x);
	}
	So.threeSum(iv);
	
	return 0;
}