-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy path461 Hamming Distance.js
57 lines (52 loc) · 1.25 KB
/
461 Hamming Distance.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
/**
* 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.
* 两个整数之间的汉明距离指的是这两个数字对应二进制位不同的位置的数目。
* 给出两个整数 x 和 y,计算它们之间的汉明距离。
* 注意: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.
*/
/**
* @param {number} x
* @param {number} y
* @return {number}
*/
const hammingDistance = (x, y) => {
let sx = x.toString(2)
let sy = y.toString(2)
let res = 0
if (sx.length !== sy.length) {
let d = Math.abs(sx.length - sy.length)
if (sx.length > sy.length) {
sy = [...sy]
for (let i = 0; i < d; i++) {
sy.unshift('0')
}
sy = sy.join('')
} else {
sx = [...sx]
for (let i = 0; i < d; i++) {
sx.unshift('0')
}
sx = sx.join('')
}
}
for (let i = 0; i < sx.length; i++) {
if (sx[i] !== sy[i]) {
res += 1
}
}
return res
}
console.log(hammingDistance(1, 4))