<Ч
Size: a a a
<Ч
E
ᅠ
ᅠ
def f(n):
digit_list = list(str(n))
for i in range(len(digit_list)-1, 0, -1):
pre_d, d = digit_list[i-1:i+1]
if d > pre_d:
digit_list[i], digit_list[i-1] = pre_d, d
return int("".join(digit_list))
return -1
print(f(315))
print(f(321))
print(f(111))
print(f(144))
print(f(398546293852))
print(f(2934785621394987654321))
print(f(0))
print(f(000000))
print(f(100001))
ᅠ
351
-1
-1
414
398546298352
2934785621399487654321
-1
-1
100010
E
E
ЯЛ
ᅠ
ᅠ
permutations(lstn)
E
ЯЛ
E
ЯЛ
ᅠ
E
ЯЛ
def jopa(num):
numm = int("".join([str(i) for i in sorted([int(x) for x in str(num)], reverse=True)]))
return numm if numm > num else -1
ЯЛ