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) {
        map<string, int> strMap;
        vector<vector<int> > ret;
        vector<int> num2;
        int count = 0;
        
        sort(num.begin(), num.end());
        for (int i = 0; i < num.size(); ++i) {
            if (i == 0) {
                num2.push_back(num[i]);
                count = 1;
                continue;
            }
            if (num[i] != num[i-1]) {
                num2.push_back(num[i]);
                count = 1;
            } else if (count == 1) {
                num2.push_back(num[i]);
                count = 2;
            } else if (count == 2 && num[i] == 0) {
                num2.push_back(num[i]);
                count = 3;
            }
        }
        
        if (num2.size() < 3) return ret;
        
        string str;
        for (int i = 0; i < num2.size() - 2; ++i) {
            int l = i+1;
            int r = num2.size()-1;
            while(l < r) {
                if (num2[i] + num2[l] + num2[r] == 0) {
                    str = to_string(num2[i]) + to_string(num2[l]);
                    if (strMap.find(str) == strMap.end()) {
                        vector<int> tmp;
                        tmp.push_back(num2[i]);
                        tmp.push_back(num2[l]);
                        tmp.push_back(num2[r]);
                        ret.push_back(tmp);
                        strMap[str] = 1;
                    }
                    ++l;
                } else if (num2[i] + num2[l] + num2[r] < 0) {
                    ++l;
                } else {
                    --r;
                }
            }
        }
        
        return ret;
    }
};