Force buckle 461 Hamming distance

461. Hamming distance
     In information theory , The Hamming distance between two equal length strings is the number of different characters in the corresponding position of two strings . let me put it another way , It is the number of characters needed to change a string into another string .

Brian · Kenigan algorithm

class Solution:
    def hammingDistance(self, x, y):
        xor = x ^ y
        distance = 0
        while xor:
            distance += 1
            # remove the rightmost bit of '1'
            xor = xor & (xor - 1)
        return distance

C++

class Solution {
    
public:
    int hammingDistance(int x, int y) {
    
        int res = x^y;
        int c = 0;
        while(res)
        {
    
            if(res&1 == 1)
                c++;
            res = res>>1;
        }
        return c;
    }
};

// & Same as 1 Otherwise 0
// | There is one for 1 Then it is 1
// ^ The two values are different by 1 Same as 0
// << Left discard The right to repair 0
// >> On the right side of the discarded Left complement 0 Negative numbers make up 1