Travis build: 391
This commit is contained in:
@ -6,10 +6,9 @@ Use XOR operator (`^`) to find the bit difference between the two numbers, conve
|
||||
Count and return the number of `1`s in the string, using `match(/1/g)`.
|
||||
|
||||
```js
|
||||
const hammingDistance = (num1, num2) =>
|
||||
((num1 ^ num2).toString(2).match(/1/g) || '').length;
|
||||
const hammingDistance = (num1, num2) => ((num1 ^ num2).toString(2).match(/1/g) || '').length;
|
||||
```
|
||||
|
||||
```js
|
||||
hammingDistance(2,3) // 1
|
||||
hammingDistance(2, 3); // 1
|
||||
```
|
||||
|
||||
Reference in New Issue
Block a user