C++ solution with nextpermutation


  • 0
    T

    class Solution {
    public:

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

       vector<vector<int>> result;
        if(nums.empty()) 
               return result;
        sort(nums.begin(),nums.end());
        result.push_back(nums);
        while(next_permutation(nums.begin(),nums.end()))
        {
            result.push_back(nums);
        }
        
        return result;
    }
    

    };


Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.