3Sum

Given an array nums of n integers, are there elements a, b, c in nums 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.

---

Example:
Given array nums = [-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());

        int numSize = nums.size();
        vector<vector<int> > vvec(0, vector<int>(0, 0));
        if (numSize < 3) return vvec;

        vector<int> vec(3, 0);
        for (int i = 0; i < numSize - 2; ++i){

            if(nums[i] > 0) break;

            if (i > 0 && nums[i] == nums[i - 1]) continue;

            int j = i + 1;
            int k = numSize - 1;
            while (j < k){
                if (nums[i] + nums[j] + nums[k] == 0){
                    vec[0] = nums[i];
                    vec[1] = nums[j];
                    vec[2] = nums[k];
                    vvec.push_back(vec);
                    while (j < k && nums[++j] == nums[j-1]) ;
                    while (j < k && nums[--k] == nums[k+1]) ;
                }
                else if (nums[i] + nums[j] + nums[k] < 0){
                    while (j < k && nums[++j] == nums[j - 1]);
                }
                else{
                    while (j < k && nums[--k] == nums[k + 1]);
                }
            }
        }
        return vvec;

    }
};