Maximum Value after Insertion LeetCode solution in Python

1
class Solution:
2
    def maxValue(self, n: str, x: int) -> str:
3
        if int(n) > 0:
4
            ans = ""
5
            flag = False
6
            for i in range(len(n)):
7
                if int(n[i]) >= x:
8
                    ans += n[i]
9
                else:
10
                    a = n[:i]
11
                    b = n[i:]
12
                    ans = a + str(x) + b
13

14
                    flag = True
15
                    break
16
            if not flag:
17
                ans += str(x)
18
        else:
19
            n = n[1:]
20
            ans = ""
21
            flag = False
22
            for i in range(len(n)):
23
                if int(n[i]) <= x:
24
                    ans += n[i]
25
                else:
26
                    a = n[:i]
27
                    b = n[i:]
28
                    ans = a + str(x) + b
29

30
                    flag = True
31
                    break
32
            if not flag:
33
                ans += str(x)
34
            ans = "-" + ans
35

36
        return ans