Hamming Distance

发表于 分类于 阅读次数：

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:** 
1
0 ≤ x, y < 2^31.
**Example:** ``` flow 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.

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
**代码如下:**
``` javascript
/**
 * @param {number} x
 * @param {number} y
 * @return {number}
 */
var  hammingDistance = function(x, y) {
         var z = x^y;
         z = z.toString(2).split("");
         var result = 0;
         z.forEach(function(val){
              if(val === '1'){
                    result++;
              }
         })
         return result;
};