leetcode-初级-汉明距离

int hammingDistance(int x, int y) {
    int m = x ^ y;
	int count = 0;
	for (int i = 0; i < 32; i++)
	{
		if ((m & 1) == 1)
			count++;
		m = m >> 1;
	}
	return count;
}

我的：

int hammingWeight(uint32_t n) {
    int count=0,yu;
    while(n!=0)
    {
        yu=n%2;
        if (yu==1) count++;
        n=n/2;
    }
    return count;
}
int hammingDistance(int x, int y) {
    int num;
    num=x^y;
    int dist=hammingWeight(num);
    return dist;
}