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)
    {
        sort(nums.begin(), nums.end());

        vector<vector<int>> result;
        if (nums.size() < 3)
            return result;

        int i, j ;
        i = j = 0;
        if (nums[i] > 0)
            return result;


        for (i = 0; i < nums.size();)
        {

            for (j = i + 1; j < nums.size() - 1;)
            {
                int temp =0-nums[i] - nums[j];
                vector<int> re;
                vector<int>::iterator iter = find(nums.begin() + j + 1, nums.end(), temp);
                if (iter != nums.end())
                {
                    vector<int> re;
                    re.push_back(nums[i]);
                    re.push_back(nums[j]);
                    re.push_back(*iter);
                    result.push_back(re);
                }
                j++;
                while (j < nums.size() && nums[j - 1] == nums[j])j++;

            }
            i++;
            while (i < nums.size() && nums[i] == nums[i - 1])i++;

        }
        return result;
    }
};

这个解法超时了，可能是STL的查找算法不太高效吧

class Solution {
public:
vector<vector<int> > threeSum(vector<int> &num) {

    vector<vector<int> > res;

    std::sort(num.begin(), num.end());

    for (int i = 0; i < num.size(); i++) {

        int target = -num[i];
        int front = i + 1;
        int back = num.size() - 1;

        if(target < 0)
        {
            break;
        }

        while (front < back) {

            int sum = num[front] + num[back];

            // Finding answer which start from number num[i]
            if (sum < target)
                front++;

            else if (sum > target)
                back--;

            else {
                vector<int> triplet(3, 0);
                triplet[0] = num[i];
                triplet[1] = num[front];
                triplet[2] = num[back];
                res.push_back(triplet);

                // Processing duplicates of Number 2
                // Rolling the front pointer to the next different number forwards
                while (front < back && num[front] == triplet[1]) front++;

                // Processing duplicates of Number 3
                // Rolling the back pointer to the next different number backwards
                while (front < back && num[back] == triplet[2]) back--;
            }

        }

        // Processing duplicates of Number 1
        while (i + 1 < num.size() && num[i + 1] == num[i]) 
            i++;

    }
     return res;
}


};