Java

public class Solution {
    public int hammingDistance(int x, int y) {
        int c=x^y;
        int i;
        for(i=0;c>0;i++)
        {
            c&=(c-1);
        }
        return i;
    }
}

Java，很简练，用到了库函数

public class Solution {
    public int hammingDistance(int x, int y) {
        return Integer.bitCount(x ^ y);
    }
}

Leetcode 461. Hamming Distance
leetcode 461. Hamming Distance TheHamming distancebetween...
461. Hamming Distance
原文地址：https://leetcode.com/problems/hamming-distance/descr...
461. Hamming Distance
总算觉得Comp arch的TA没白当hhh 问题描述 The Hamming distance between ...
461. Hamming Distance
Leetcode Day 2 题目：The Hamming distance between two intege...
461. Hamming Distance
The Hamming distance(https://en.wikipedia.org/wiki/Hammi...
461. Hamming Distance
The Hamming distance between two integers is the number o...
461. Hamming Distance
https://leetcode.com/problems/hamming-distance/descriptio...
461. Hamming Distance
思路从两个数的二进制最低位开始比较，每比较一位就除2并继续比较最低位，直到两个数全为0时停止。代码
461. Hamming Distance
题目的要求是得出两个整数的二进制表示下对应位数上的不同数字的位数。下方是官网给出的范例，可以帮助理解。这个题目要...
461. Hamming Distance
Java Java，很简练，用到了库函数