## 题目描述：

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`.

## 题目大意：

1. 元素大小在[0, 10^9]之间。
2. 数组长度不超过10^4。

## 解题思路：

`ans = ∑(zero[i] * one[i]),  i∈[0, 31]`

## Python代码：

``````class Solution(object):
def totalHammingDistance(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
ans = 0
for x in range(32):
zero = one = 0
for num in nums:
one += 1
else:
zero += 1
ans += zero * one
return ans
``````

Pingbacks已关闭。