Shifting bits and modulo


  • 0
    J
        public int hammingDistance(int x, int y) {
            int ret = 0;
            while (x != 0 || y != 0) {
                if (x % 2 != y % 2) ret ++;
                x = x >> 1;
                y = y >> 1;
            }
            return ret;
        }
    

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.