# LeetCode 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.

## 解题代码

    public int totalHammingDistance(int[] nums) {
int sum = 0;
for (int i = 0; i < 32; i++) {
int ones = 0;
for (int j = 0; j < nums.length; j++)
ones += (nums[j] >> i) & 0x1;
sum += ones * (nums.length - ones);
}
return sum;
}
04-21 1440                                                                          12-05 601
07-02 212
12-27 296
01-04 470
01-01 496
07-02 289
12-18 762
03-26 317
12-30 899
09-11 300
05-13 86
12-05 155
09-05 368
©️2020 CSDN 皮肤主题: 大白 设计师:CSDN官方博客