LeetCode知识点总结 - 1053

LeetCode 1053. Previous Permutation With One Swap

考点	难度
Greedy	Easy

题目

Given an array of positive integers arr (not necessarily distinct), return the
lexicographically
largest permutation that is smaller than arr, that can be made with exactly one swap. If it cannot be done, then return the same array.

Note that a swap exchanges the positions of two numbers arr[i] and arr[j]

思路

先找到比右一位小的数x（如果不存在返回A本身）把x和在x右边比x小的数里最大的数y交换。
必须在x右边因为：可能交换结果大于A
y不能大于x因为：结果一定大于A
y不能不是尽量大因为：结果需要越大越好

答案

class Solution(object):
    def prevPermOpt1(self, A):
        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] < A[i]: 
					max_ = j
			A[max_], A[i] = A[i], A[max_]
        return A