[Programmers] Lv 2. 다음 큰 숫자

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

프로그래머스

 

function solution(n) {
    const len = n.toString(2).split("1").length - 1;
    ++n;
    while (len != n.toString(2).split("1").length - 1) ++n;
    return n;
}

GitHub : https://github.com/developeSHG/Algorithm-Baekjoon_Programmers/tree/main/%ED%94%84%EB%A1%9C%EA%B7%B8%EB%9E%98%EB%A8%B8%EC%8A%A4/lv2/12911.%E2%80%85%EB%8B%A4%EC%9D%8C%E2%80%85%ED%81%B0%E2%80%85%EC%88%AB%EC%9E%90

GitHub - developeSHG/Algorithm-Baekjoon_Programmers: 백준 and 프로그래머스 소스코드