# Total Hamming Distance Problem

## Description

LeetCode Problem 477.

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

Given an integer array nums, return the sum of Hamming distances between all the pairs of the integers in nums.

Example 1:

``````1
2
3
4
5
6
Input: nums = [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).
HammingDistance(4, 14) + HammingDistance(4, 2) + HammingDistance(14, 2) = 2 + 2 + 2 = 6.
``````

Example 2:

``````1
2
Input: nums = [4,14,4]
Output: 4
``````

Constraints:

• 1 <= nums.length <= 10^4
• 0 <= nums[i] <= 10^9
• The answer for the given input will fit in a 32-bit integer.

## Sample C++ Code

``````1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
class Solution {
public:
int totalHammingDistance(vector<int>& nums) {
if (nums.size() <= 0)
return 0;
int res = 0;
for (int i = 0; i < 32; i++) {
int setCount = 0;
for (int j = 0; j < nums.size(); j++) {
if (nums[j] & (1 << i)) setCount++;
}
res += setCount * (nums.size() - setCount);
}
return res;
}
};
``````