3Sums

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.

思路：先排序，采用三个指针，固定一个指针，另两个指针指向排序数组的两极，可以在O(n)时间遍历完两个指针。 时间复杂度是O(n^2)

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

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

#include <algorithm>

class Solution {
public:
    vector<vector<int>> threeSum(vector<int>& nums) {
        if(nums.size()  < 3){
            return {};
        }
        vector<vector<int>> result;
        sort(nums.begin(), nums.end());
        for(int a = 0; a <= nums.size() - 3 && nums[a] <=0;)
        {
            int b = a + 1;
            int c = nums.size() - 1;
            while(b < c)
            {
                int sum = nums[a] + nums[b] + nums[c];
                if(sum == 0){
                    result.push_back({nums[a], nums[b], nums[c]});
                    c--;
                    while(b < c && nums[c] == nums[c+1]) c--;
                    b++;
                    while(b < c && nums[b] == nums[b-1]) b++;
                }
                else if(sum > 0){
                    c--;
                    while(b < c && nums[c] == nums[c+1]) c--;
                }else{
                    b++;
                    while(b < c && nums[b] == nums[b-1]) b++;
                }
            }
            a++;
            while(a <= nums.size() - 3 && nums[a] == nums[a-1]) a++;
        }
        return result;
    }
};