다음 큰 숫자

#include <string>
#include <vector>
#include <iostream>
#include <stdio.h>
#include <algorithm>

using namespace std;

int getBinOneAmount(int n)
{
    vector<int> binVector;
    
    // 이진법 변환
    int bin = 0;
    
    while(n >= 1)
    {
        bin = n % 2;
        n = n / 2;
        
        // cout << "n = " << n << endl;
        
        binVector.push_back(bin);
    }
    
    int cnt = 0;
    
    for(int i=binVector.size()-1; i>=0; i--)
    {
        // printf("%d", binVector[i]);
        
        if(binVector[i] == 1)
        {
            cnt++;
        }
    }
    
    return cnt;
}

int solution(int n) {
    
    int answer = 0;
    int binN_Num = getBinOneAmount(n);    
    
    printf("binN_Num = %d\n", binN_Num);
    
    while(true)
    {
        n++;
        answer = n;
        
        int binA_Num = getBinOneAmount(answer);
        
        if(binN_Num == binA_Num)
        {
            break;
        }        
    }
    
    return answer;
}