位操作－leetcode 461 Hamming Distance

原題鏈接：Hamming Distance

題解：

class Solution {
public:
    int hammingDistance(int x, int y) {
        /*
        	Time Complexity:O(1)
               Space Complexity:O(1)
        */
        x^=y;
        int count=0;
        while(x){
            count+=x&1;
            x=x>>1;
        }
        return count;
    }
};