LeetCode Day26 Next Permutation

class Solution {
public:
    void nextPermutation(vector<int>& nums) {
        for(int i=nums.size()-1;i>0;i--){
            if(nums[i]>nums[i-1]){
                int j=i-1;
                while(nums[++j]>nums[i-1]&&j<nums.size());
                swap(nums[j-1],nums[i-1]);
                reverse(nums.begin()+i,nums.end());
                return;            
            }
        }
        reverse(nums.begin(),nums.end());
        
    }
};