You are viewing a single comment's thread. Return to all comments →
It is a nice solution. My solution is similar with no additional method calls.
int x = l ^ r; int max = 0; while(x > 0) { max <<= 1; max |= 1; x >>= 1; } return max;
Seems like cookies are disabled on this browser, please enable them to open this website
Maximizing XOR
You are viewing a single comment's thread. Return to all comments →
It is a nice solution. My solution is similar with no additional method calls.