LeetCode-Solutions/Python/maximum-swap.py at master · pythonpeixun/LeetCode-Solutions · GitHub

20 lines (18 loc) · 600 Bytes

# Time: O(logn), logn is the length of the number string

# Space: O(logn)

class Solution(object):

def maximumSwap(self, num):

"""

:type num: int

:rtype: int

"""

digits = list(str(num))

left, right = 0, 0

max_idx = len(digits)-1

for i in reversed(xrange(len(digits))):

if digits[i] > digits[max_idx]:

max_idx = i

elif digits[max_idx] > digits[i]:

left, right = i, max_idx

digits[left], digits[right] = digits[right], digits[left]

return int("".join(digits))

Expand file tree