Maximum Swap LeetCode solution in Python

1
class Solution:
2
    def maximumSwap(self, num: int) -> int:
3
        digits = [int(x) for x in str(num)]
4
        n = len(digits)
5

6
        for i in range(n):
7
            maxx = digits[i]
8
            indx = i
9

10
            for j in range(i + 1, n):
11
                if digits[j] >= maxx and digits[j] != digits[i]:
12
                    maxx = digits[j]
13
                    indx = j
14

15
            if indx != i:
16
                digits[i], digits[indx] = digits[indx], digits[i]
17

18
                # only one swap allowed
19
                return "".join([str(x) for x in digits])
20

21
        # already sorted
22
        return num