Leetcode #15 3 Sum

原题：

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)

O(n^2)的算法 ：单层枚举+双指针线性扫描

vector<vector<int> > threeSum(vector<int> &num) {
    vector<vector<int> > ans;
    if(num.size() < 3) return ans;
    sort(num.begin(), num.end());
    for(int i = 0; i < num.size() - 2; i ++) {
        if(i && num[i] == num[i-1]) continue;

        int a = i + 1, b = num.size() - 1;
        if(num[i] + num[a] > 0) continue;
        if(num[i] > 0 && num[a] > 0) break;
        int sum = -num[i];
        while(a < b) {
            if(a != i + 1 && num[a] == num[a-1]) a ++;
            else if(b != num.size()-1 && num[b] == num[b+1]) b --;
            else if(num[a] + num[b] > sum) b--;
            else if(num[a] + num[b] < sum) a ++;
            else {
                vector<int> tmp;
                tmp.push_back(num[i]);
                tmp.push_back(num[a]);
                tmp.push_back(num[b]);
                ans.push_back(tmp);
                a ++;
                b --;
            }
        }
    }
    return ans;
}

O((n^2)lgn)的算法 ：双重枚举+二分查找

vector<vector<int> > threeSum(vector<int> &num) {
    vector<vector<int> > ans;
    if(num.size() < 3) return ans;
    sort(num.begin(), num.end());
    for(int i = 0; i < num.size()-2; i ++) {
        if(i && num[i] == num[i-1]) continue;
        for(int j = i+1; j < num.size()-1; j ++) {
            if(j != i+1 && num[j] == num[j-1]) continue;
            if(num[i] > 0 && num[j] > 0) break;

            int sum = -(num[i] + num[j]);
            int l = j+1, r = num.size();

            int m = 0;
            while(l < r) {      //binary search
                m = (l+r)/2;
                if(num[m] < sum) l = m+1;
                else if( num[m] > sum) r = m;
                else break;
            }
            if(num[m] == sum) {             //found sum.
                vector<int> tmp;
                tmp.push_back(num[i]);
                tmp.push_back(num[j]);
                tmp.push_back(sum);
                ans.push_back(tmp);
            }
        }
    }
    return ans;
}