단순 구현 문제
초고수는.. XOR을 활용해 풀었더라...
class Solution
{
public int solution(int n, int a, int b)
{
int answer = 0;
String binaryString = Integer.toBinaryString(n);
for (int i = 0; i < binaryString.length(); i++){
answer++;
if ((a+1) / 2 == (b + 1) /2) {
break;
}
a = (a + 1) /2;
b = (b + 1) /2;
}
return answer;
}
}