Leetcode 31. Next Permutation

问题描述

结题方法

C++

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

时间与空间复杂度分析

Time complexity

$$\mathcal{O}=log(n)$$

Space complexity

$$\mathcal{O}=log(1)$$