230605 2개 이하로 다른 비트

public long[] solution(long[] numbers) {
    long[] answer = new long[numbers.length];
    for (int i = 0; i < numbers.length; i++) {
        if (numbers[i] % 2 == 0) {
            answer[i] = numbers[i] + 1;
        } else {
            String binaryString = Long.toBinaryString(numbers[i]);
            int zeroIdx = binaryString.lastIndexOf("0");
            if (zeroIdx != -1) {
                binaryString = binaryString.substring(0, zeroIdx) + "10" + binaryString.substring(zeroIdx + 2);
                answer[i] = Long.parseLong(binaryString, 2);
            } else {
                binaryString = "10" + binaryString.substring(1);
                answer[i] = Long.parseLong(binaryString, 2);
            }
        }
    }
    return answer;
}

출처:https://school.programmers.co.kr/learn/courses/30/lessons/77885