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:

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

---

如果按照正常思路需要的复杂度为O(n^2)，按下列算法复杂度将为了O(n)。具体思路是利用对所有数的第i位求汉明距离，然后将32位的分别的汉明距离和相加得到答案。所有数的某一位的汉明距离可以用（含1的个数×不含1的个数）来求出。

class Solution {
    public int totalHammingDistance(int[] nums) {
        int bitCount = 0;
        int total = 0;
        for(int i = 0; i < 32; i++){
            bitCount = 0;
            for(int j = 0; j < nums.length; j++){
                bitCount += (nums[j] >> i) & 1;
            }
            total += bitCount * (nums.length - bitCount);
        }
        return total;
    }
}