小米笔试题 懂二进制

/**
* Created by ustc-lezg on 16/4/8.
*/
public class Solution {
public int countBitDiff(int m, int n) {
//异或,相等为0,不相等为1
int x = m ^ n;
int count = 0;
//统计整数x的二进制含有多少个1
while (x > 0) {
x = x & (x - 1);
++count;
}
return count;
}
}