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]
]

vector<vector<int>> threeSum(vector<int>& nums) {

        sort(nums.begin(),nums.end());
        vector<vector<int>> result;
        vector<int> temp;   
        int i,j;
        int size = nums.size();//https://discuss.leetcode.com/topic/82514/runtime-error-message-reference-binding-to-null-pointer-of-type-struct-value_type/4
        for(i = 0; i < size-2; i++)
        {
            if(i == 0 || (i > 0 && nums[i]!=nums[i-1]))
            {
                int head = i + 1;
                int tail = size - 1;
                int sum = 0 - nums[i];
                while(head < tail)
                {
                   if (nums[head] + nums[tail] == sum)
                   {
                      temp.clear();
                      temp.push_back(nums[i]);
                      temp.push_back(nums[head]);
                      temp.push_back(nums[tail]);
                      result.push_back(temp);  
                      while(nums[head] == nums[head + 1] && head < tail) head++;
                      while(nums[tail] == nums[tail - 1] && head < tail) tail--;
                      head++;
                      tail--;              
                  }
                  else if(nums[head] + nums[tail] < sum )
                  {
                     head++;
                  }
                 else tail--;
              }            
            }
        }
            
        return result;
    }
    
};