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)

vector<vector<int> > threeSum(vector<int> num) {
    vector<vector<int>> Result;
    vector<int> temp(3);
    sort(num.begin(),num.end());
    if(num.size()<3)
        return Result;
    for(int i=0; i<num.size()-1; i++){
        while(i!=0&&num[i]==num[i-1])
            i+=1;
        int Start=i+1;
        int End=num.size()-1;
        while(Start<End){
            if(num[i]+num[Start]+num[End]>0){
                End-=1;
            }
            else if(num[i]+num[Start]+num[End]==0){
                temp[0]=num[i];
                temp[1]=num[Start];
                temp[2]=num[End];
                Result.push_back(temp);
                while(Start<End&&temp[1]==num[Start]){
                    Start+=1;
                }

            }else{
                Start+=1;
            }


        }
    }
    return Result;
}

(-1, -1, 2)