1053-Previous-Permutation-With-One-Swap
Sat 17 May 2025
https://leetcode.com/problems/previous-permutation-with-one-swap
import pyutil as pyu
pyu.get_local_pyinfo()
print(pyu.ps2("python-dotenv"))
from typing import List
class Solution:
def prevPermOpt1(self, A: List[int]) -> List[int]:
n = len(A)
l = n - 2
r = n - 1
while l >= 0 and A[l] <= A[l + 1]:
l -= 1
if l < 0:
return A
while A[r] >= A[l] or A[r] == A[r - 1]:
r -= 1
A[l], A[r] = A[r], A[l]
return A
new Solution().prevPermOpt1()
Score: 5
Category: leetcode