c_cpp 31.下一个排列

Posted 2021-05-14

class Solution {
public:
    void nextPermutation(vector<int>& nums) {
        if (nums.empty() || nums.size() == 0) return;
        
        int firstSmall = -1;
        for (int i = nums.size() - 2; i >= 0; i--) {
            if (nums[i] < nums[i + 1]) {
                firstSmall = i;
                break;
            }
        }
        
        if (firstSmall == -1) {
            reverse(nums.begin(), nums.end());
            return;
        }
        
        int firstLarge = -1;
        for (int i = nums.size() - 1; i > firstSmall; i--) {
            if (nums[i] > nums[firstSmall]) {
                firstLarge = i;
                break;
            }
        }
        
        swap(nums[firstSmall], nums[firstLarge]);
        reverse(nums.begin() + firstSmall + 1, nums.end());   // need "+1"
        return;
    }
};