LeetCode之旅（34）

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)

class Solution {
public:
    vector<vector<int> > threeSum(vector<int> &num) {
        vector<vector<int> > res;
        int s = num.size();
        if (!s) return res;
        sort(num.begin(), num.end());
        for (int i=0; i<s; i++) {
            if (i && num[i]==num[i-1]) continue;
            int l = i+1, r = s-1;
            while (l < r) {
                int sum = num[i] + num[l] + num[r];
                if (sum > 0) r--;
                else if (sum < 0) l++;
                else if (l != i+1 && num[l] == num[l-1]) l++;  //去重
                else if (r != s-1 && num[r] == num[r+1]) r--;
                else {
                    vector<int> tmp;
                    tmp.push_back(num[i]);
                    tmp.push_back(num[l]);
                    tmp.push_back(num[r]);
                    res.push_back(tmp);
                    l++, r--;
                }
            }
        }
        return res;
    }
};