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(32 * n^2 )，循环遍历两遍，找出32bit的异或位数，然后再累和。

优化
O(n) 的方法是借助32个bit的位图，统计所有数在每个bit位上为1的个数，那么最终该位对于汉明距离总和的贡献和
count * (n - count )，累加32个bit上的贡献和即可。

代码

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