[Python][sort][sorted] 정수 내림차순으로 배치하기

[나의 풀이]

def solution(n):
    list = []
    x = str(n)
    s = ""
    for i in range(len(x)):
        list.append(x[i])
        list.sort(reverse=True)
    for j in range(len(list)):
        s += list[j]
    return int(s)

[다른 풀이]

def solution(n):
    ls = list(str(n))
    ls.sort(reverse = True)
    return int("".join(ls))

def solution(n):
    return int("".join(sorted(str(n), reverse=True)))

def solution(n):
    answer = ''
    lst = []
    
    while n > 0:
        r = n % 10
        n = n // 10
        lst.append(r)
        
    lst.sort()
    lst.reverse()
    
    for j in range(0, len(lst)):
        answer += str(lst[j])
        
    return int(answer)

[sort, sorted 함수 예시]

 

참고

cigiko.cafe24.com/python-%EC%A0%95%EB%A0%AC%ED%95%98%EA%B8%B0-sort%EC%99%80-sorted/

[Python] sort()와 sorted()로 정렬하기 – nc2u 블로그