[레벨1] 3진법 뒤집기

#include <string>
#include <vector>
#include <stack>

using namespace std;

int solution(int n) {
    int answer = 0;
    stack<int> a;
    while(n >= 1)
    {
        a.push(n % 3);
        n /= 3;
    }
    int len = a.size();
    int digit = 1;
    for(int i = 0; i < len; ++i)
    {
        answer += a.top() * digit;
        a.pop();
        digit *= 3;
    }
    
    return answer;
}