LeetCode 461. Hamming Distance
撰写于 20171103 修改于 20180121 分类 LeetCode
Question
The Hamming distance between two integers is the number of positions at which the corresponding bits are different.
Given two integers x and y, calculate the Hamming distance.
Note:
0 <= x, y < 2^31.
Example:
Input: x = 1, y = 4
Output: 2
Explanation:


The above arrows point to positions where the corresponding bits are different.
Solution
The idea is easy to understand, you should use >>
to get the newest value, if the value is an odd number, count += 1
, and number = number  1
to make it even until to 0
.
Code
python code

