leetcode Three sum(Medium) C++

Three sum

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

Attention: I have use STL for simplify the program.

class Solution {
public:
    vector<vector<int>> threeSum(vector<int>& nums) 
    {
        vector<vector<int>> Result;
        int Size=nums.size();
        sort(nums.begin(),nums.end());
        int i,j,k;
        for(i=0;i<Size-2;i++)
        {
            while(nums[i]>0&&i<Size-2)
                i++;
            j=i+1;k=Size-1;
            while(j<k)
            {
                if(nums[i]+nums[j]+nums[k]==0)
                {
                   
                    Result.push_back({nums[i], nums[j], nums[k]});
                    while(nums[j]==nums[j+1]&&j+1<Size)
                        j++;//不满足循环恰好nums[j]!=nums[j+1],跳出后当然还需要++1
                        j++;//这里的j++注意
                }
                else if(nums[i]+nums[j]+nums[k]>0)
                    k--;
                else
                    j++;
            }
            while(i+1<Size&&nums[i]==nums[i+1])
                i++;//这里不需要在下面补i++，因为for循环自带i++；
        }
        return Result;
    }


};

本程序只用于学习参考之用，转载请注明出处。
记得点赞哦！！