## 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, 2Output:6Explanation: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:**

- Elements of the given array are in the range of
`0`

to`10^9`

- Length of the array will not exceed
`10^4`

.

## Rust Solution

```
struct Solution;
impl Solution {
fn total_hamming_distance(nums: Vec<i32>) -> i32 {
let mut res = 0;
let n = nums.len();
for i in 0..32 {
let mut count = 0;
for &x in &nums {
if x & 1 << i != 0 {
count += 1;
}
}
res += count * (n - count);
}
res as i32
}
}
#[test]
fn test() {
let nums = vec![4, 14, 2];
let res = 6;
assert_eq!(Solution::total_hamming_distance(nums), res);
}
```

Having problems with this solution? Click here to submit an issue on github.