3Sum

Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.

Note:

• Elements in a triplet (a,b,c) must be in non-descending order. (ie, a ≤ b ≤ c)
• The solution set must not contain duplicate triplets.

    For example, given array S = {-1 0 1 2 -1 -4},

    A solution set is:
    (-1, 0, 1)
    (-1, -1, 2)

因为昨天做了3 sum closest,再做这道题发现原来这么简单,可能出题人的意图是先3sum再3sumclosest吧.

class Solution {
public:
    vector<vector<int> > threeSum(vector<int> &num) {
        vector<vector<int> > ret;
        if(num.size() < 3)
        {
            return ret;
        }
        sort(num.begin(), num.end());
        int i = 0;
        while(i < num.size() - 2)
        {
        	int k = num.size() - 1;
        	int j = i + 1;
        	while(j < k)
        	{
        		int part = num[i] + num[j];
        		int x;
        		for(k; k > j && (x = part + num[k]) > 0; k--)
        		{}
        		if(x == 0)
        		{
        			vector<int> buf;
        			buf.push_back(num[i]);
        			buf.push_back(num[j]);
        			buf.push_back(num[k]);
        			ret.push_back(buf);
        			k--;
        		}
        		while(num[j + 1] == num[j])//考虑到重复元素(题目要求解不重复),要跳过.
        		{
        		    j++;
        		}
        		j++;
        	}
        	while(num[i + 1] == num[i])//同上
        	{
        	    i++;
        	}
        	i++;
        }
        return ret;
    }
};