15. 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: 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>& nums) {
        vector<vector<int>> result;
        int size = nums.size();
        sort(nums.begin(), nums.end());

        for (int a = 0; a < size; a++) {
            while (a > 0 && a < size && nums[a] == nums[a - 1])
                a++;

            int b = a + 1;
            int c = 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]});

                    b++;
                    c--;

                    while (b < c && nums[b] == nums[b - 1])
                        b++;
                    while (b < c && nums[c] == nums[c + 1])
                        c--;
                }
                else if (sum < 0) {
                    b++;
                    while (b < c && nums[b] == nums[b - 1])
                        b++;
                }
                else {
                    c--;
                    while (b < c && nums[c] == nums[c + 1])
                        c--;
                }
            }
        }
        return result;
    }
};