LeetCode461.汉明距离（C++）位运算

class Solution {
public:int hammingDistance(int x, int y) {//异或&＃xff1a;找到哪几位不一样int temp &＃61; x^y;int res &＃61; 0;//统计有多少个不一样的位&＃xff0c;也就是有多少个1while (temp > 0){res &＃43;&＃61; temp % 2;temp /&＃61; 2;}return res;}
};