Last active
May 20, 2024 23:44
-
-
Save yphastos/33e46f285ab4b47aae11fc98994799c0 to your computer and use it in GitHub Desktop.
equal Pair Of Bits
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
int equalPairOfBits(int n, int m) { | |
return Integer.lowestOneBit(~(n^m)) ; | |
} | |
int equalPairOfBits(int n, int m) { | |
return (n^=~m)&-n ; | |
} | |
int equalPairOfBits(int n, int m) { | |
return ((n^~m)|((n^~m)-1)) - ((n^~m)-1) ; | |
} | |
int equalPairOfBits(int n, int m) { | |
return ((n = m^n) ^ (n+1))/2 +1 ; | |
} | |
int equalPairOfBits(int n, int m) { | |
return ~(n^m) & (-~(n^m)) ; | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
interesting , can u provide reference of bitwise hacks like these