Skip to content

Instantly share code, notes, and snippets.

@yphastos
Last active May 20, 2024 23:44
Show Gist options
  • Save yphastos/33e46f285ab4b47aae11fc98994799c0 to your computer and use it in GitHub Desktop.
Save yphastos/33e46f285ab4b47aae11fc98994799c0 to your computer and use it in GitHub Desktop.
equal Pair Of Bits
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)) ;
}
@Zouhair-Boulahlib
Copy link

interesting , can u provide reference of bitwise hacks like these

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment