当前位置：网站首页>31. Next arrangement

31. Next arrangement

2022-04-23 12:51:00 【anieoo】

Original link ：31. Next spread

 

solution: Brain teaser // After reading the solution to the problem, I will come to the idea orz

 

class Solution {
public:
    void nextPermutation(vector<int>& nums) {
        int k = nums.size() - 1;
        while(k && nums[k - 1] >= nums[k]) k--; //k Greater than 0 And satisfy that the next number is greater than or equal to this number ,k--
        if(k == 0){ //k == 0 Description the array is arranged in full descending order 
            sort(nums.begin(),nums.end());
            return;
        }
        else{
            int t = k;
            while(t < nums.size() && nums[t] > nums[k - 1]) t++;    
            swap(nums[t - 1],nums[k - 1]);
            reverse(nums.begin() + k,nums.end());
        }


    }
};

 

版权声明
本文为[anieoo]所创，转载请带上原文链接，感谢
https://yzsam.com/2022/04/202204231248410328.html

边栏推荐

猜你喜欢

随机推荐