[프로그래머스][Level 1] 3진법 뒤집기

https://school.programmers.co.kr/learn/courses/30/lessons/68935

def solution(n):
    def ternary(n):
        if n//3 == 0:
            return str(n%3)
        else:
            return ternary(n//3)+str(n%3)   
    def ter_to_deci(n):
        reverse_n = n[::-1]
        answer = 0
        for i in range(len(reverse_n)):
            answer += int(reverse_n[i])*(3**i)
        return answer
            
    return ter_to_deci(ternary(n)[::-1])

 

함수로 말고 쉽게 다시 풀어보기