[leetcode] 1053. Previous Permutation With One Swap

Description

Given an array A of positive integers (not necessarily distinct), return the lexicographically largest permutation that is smaller than A, that can be made with one swap (A swap exchanges the positions of two numbers A[i] and A[j]). If it cannot be done, then return the same array.

Example 1:

Input: [3,2,1]
Output: [3,1,2]
Explanation: Swapping 2 and 1.

Example 2:

Input: [1,1,5]
Output: [1,1,5]
Explanation: This is already the smallest permutation.

Example 3:

Input: [1,9,4,6,7]
Output: [1,7,4,6,9]
Explanation: Swapping 9 and 7.

Example 4:

Input: [3,1,1,3]
Output: [1,3,1,3]
Explanation: Swapping 1 and 3.

Note:

1. 1 <= A.length <= 10000.
2. 1 <= A[i] <= 10000.

分析

题目的意思是：给你一个数组，代表一个排列，求小于该排列的最大排列是哪个。这道题似曾相识，首先从右向左遍历找到第一个A[i]>A[i+1]的数，这个位置就是需要交换的第一个位置，然后再找第二个，从这个位置向右赵比当前数第二小的数，然后一交换就行了。

代码

class Solution:
    def prevPermOpt1(self, A: List[int]) -> List[int]:
        i=len(A)-2
        while(i>=0 and A[i]<=A[i+1]):
            i-=1
        if(i>=0):
            max_=i+1
            # max number greater on right that less than A[i]
            for j in range(max_+1,len(A)):
                if(A[max_]<A[j] and A[j]<A[i]):
                    max_=j
            A[max_],A[i]=A[i],A[max_]

        return A
        

参考文献

[LeetCode] easy to understand O(n) solution