//LV2. 2개이하로 다른 비트 2022.07.26 완료
public static long[] solution_under_two_bit(long[] numbers) {
long[] answer = new long[numbers.length];
for(int i = 0; i < numbers.length;i++){
String target = Long.toBinaryString(numbers[i]);
int idx = target.lastIndexOf("0");
if(idx == target.length()-1){ // 마지막숫자가 0일경우
answer[i] = numbers[i]+1;
}else if(idx == -1){ // 첫자리가 0일 경우
answer[i] = Long.parseUnsignedLong("10"+target.substring(idx+2),2);;
}else{
answer[i] = Long.parseUnsignedLong(target.substring(0,idx)+"10"+target.substring(idx+2),2);
}
}
return answer;
}