670-Maximum-Swap
Sat 17 May 2025
https://leetcode.com/problems/maximum-swap
import pyutil as pyu
pyu.get_local_pyinfo()
print(pyu.ps2("python-dotenv"))
from typing import List
class Solution:
def maximumSwap(self, num: int) -> int:
s = list(str(num))
dict = {c: i for i, c in enumerate(s)}
for i, c in enumerate(s):
for digit in reversed(string.digits):
if digit <= c:
break
if digit in dict and dict[digit] > i:
s[i], s[dict[digit]] = digit, s[i]
return int(''.join(s))
return num
new Solution().maximumSwap()
Score: 5
Category: leetcode