# problem0477

package
Version: v0.0.0-...-899dd15 Latest Latest

This package is not in the latest version of its module.

Go to latest
Published: Sep 11, 2020 License: MIT

## README ¶

### 477. Total Hamming Distance

#### 题目

The Hamming distance between two integers is the number of positions at which the corresponding bits are different.

Now your job is to find the total Hamming distance between all pairs of the given numbers.

Example:

``````Input: 4, 14, 2

Output: 6

Explanation: In binary representation, the 4 is 0100, 14 is 1110, and 2 is 0010 (just
showing the four bits relevant in this case). So the answer will be:
HammingDistance(4, 14) + HammingDistance(4, 2) + HammingDistance(14, 2) = 2 + 2 + 2 = 6.
``````

Note:

1. Elements of the given array are in the range of 0 to 10^9
2. Length of the array will not exceed 10^4.

## Documentation ¶

There is no documentation for this package.

## Keyboard shortcuts

 ? : This menu / : Search site f or F : Jump to t or T : Toggle theme light dark auto y or Y : Canonical URL