LeetCode 461. Hamming Distance
撰写于 2017-11-03 修改于 2018-01-21 分类 LeetCode
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.
0 <= x, y < 2^31.
Input: x = 1, y = 4
The above arrows point to positions where the corresponding bits are different.
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