3진법 뒤집기(Lv1)

#include <string>
#include <vector>
#include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;

int solution(int n) {
    int answer = 0;
    
    vector<int> vContainer;
    vector<int> vRContainer;
    
    while(1)
    {
        if(n<3)         
        {
            vContainer.push_back(n);      
            break;
        }
        
        int iTemp = n%3;
        vContainer.push_back(iTemp);
        n = n/3;
    }
 
	for (int i = 0; i < vContainer.size(); i++)
	{
		int j = vContainer.size() - 1-i;
		
			//cout << vContainer[i] << endl;
			answer += vContainer[i] * pow(3, j);
	}
    
    return answer;
}