LeetCode:461 Hamming Distance

一：原题题目

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 < 231.

Example:

Input: x = 1, y = 4

Output: 2

Explanation:
1   (0 0 0 1)
4   (0 1 0 0)
       ↑   ↑

The above arrows point to positions where the corresponding bits are different.

二：原题分析

首先百度查询了一下所谓Hamming Distance，也就是汉明距离的定义，基本可以理解为他就是将一个字符串变换成另一个字符串所需要替换的字符个数。如上图的例子，0001和0100有两位不同，他们的汉明距离就等于2.

三：解答