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]
]
题意就不说了，一开始我是想用更快的方法，结果想不到233333，这题是枚举一个数，然后再找到其他两个数的位置，枚举的数不要从中间开始，会有一些枚举不出来，要从最左边开始。然后会超时，需要剪枝，枚举过重复的就不选择。之后会有排序问题和除重问题，所以我就用了set解决。

class Solution {
public:
    vector<vector<int>> threeSum(vector<int>& nums) {
        sort(nums.begin(), nums.end());
        int len = nums.size();
        vector<vector<int> > v;
        vector<int> vv;
        set<vector<int> > s;
        int r, l;
        for(int i = 0; i < len - 2; ++ i)
        {
            while(i > 0 && i < len - 2 && nums[i] == nums[i - 1])
            i++;
            r = len - 1, l = i + 1;
            while(l < r)
            {
                if(nums[i] + nums[l] + nums[r] == 0)
                {
                    vv.clear();
                    vv.push_back(nums[i]);
                    vv.push_back(nums[l]);
                    vv.push_back(nums[r]);
                    s.insert(vv);
                    r--;l++;
                }
                else if(nums[i] + nums[l] + nums[r] > 0)
                r--;
                else
                l++;
            }
        }
        /*sort(v.begin(), v.end());
        vector<vector<int> >::iterator iter;
        iter = unique(v.begin(), v.end());
        if(iter != v.end());
        v.erase(iter, v.end());*/
        set<vector<int> >::iterator iter;
        for(iter = s.begin(); iter != s.end(); ++ iter)
            v.push_back((*iter));
        return v;
    }
};