Your task is to make a function that can take any non-negative integer as a argument and return it with its digits in descending order. Essentially, rearrange the digits to create the highest possible number.
将一个整数倒序排列。例子如下:
Examples:
Input: 21445 Output: 54421
Input: 145263 Output: 654321
Input: 1254859723 Output: 9875543221
源码,
def Descending_Order(num):
nlist = []
listnum = list(str(num))
while True:
temp = 0
tempindex = 0
for i in range(len(listnum)):
if int(temp) <= int(listnum[i]):
temp = listnum[i]
tempindex = i
nlist.append(temp)
del listnum[tempindex]
if listnum == []:
break
return int(''.join(nlist))
源码2
def Descending_Order(num):
nn = list(str(num))
nn.sort(reverse = True)
number = "".join(nn)
return int(number)