다음 큰 숫자

function solution(n) {
  const binary = "0" + n.toString(2);
  if (binary.includes("0")) {
    const binaryAddZero = binary;
    const lastOfOne = binaryAddZero.lastIndexOf("1");
    const lastOfZero = binaryAddZero.lastIndexOf("0");
    const beforeLastOfOne = binaryAddZero.substring(0, lastOfOne);
    const lastOfZeroOfbeforeLastOfOne = beforeLastOfOne.lastIndexOf("0");
    const countOfOneOfLastOfZeroBeforeLastOfOne =
      [...binaryAddZero].filter((bin, index) => {
        if (index > lastOfZeroOfbeforeLastOfOne && bin == "1") return bin;
      }).length - 1;
    const result = (
      binaryAddZero.substring(0, lastOfZeroOfbeforeLastOfOne) + "1"
    )
      .padEnd(binaryAddZero.length - countOfOneOfLastOfZeroBeforeLastOfOne, "0")
      .padEnd(binaryAddZero.length, "1");
    return parseInt(result, 2);
  } else {
    const result = binary.replace("1", "10");
    return parseInt(result, 2);
  }
}