LintCode 1217: Total Hamming Distance

1217. 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
Example 1:

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.
Example 2:

Input: [2, 1, 0]
Output: 4
Explanation: In binary representation, the 2 is 10, 1 is 01, and 0 is 00 (just
showing the four bits relevant in this case). So the answer will be:
HammingDistance(2, 1) + HammingDistance(1, 0) + HammingDistance(2, 0) = 2 + 1 + 1 = 4.
Notice
Elements of the given array are in the range of 0 to 10^9
Length of the array will not exceed 10^4.

解法1：
这题最直接的做法就是按每个位把n个数分为2组，一组是该位为1的，另一组是该位为0的。
对于该位而言，其产生的hamming distance是total1Count * total0Count，因为1组每个成员跟0组每个成员都有1个链接。

class Solution {
public:
    /**
     * @param nums: the gievn integers
     * @return: the total Hamming distance between all pairs of the given numbers
     */
    int totalHammingDistance(vector<int> &nums) {
        int n = nums.size();
        int totalDist = 0;
        int intSizeInBits = sizeof(int) * 8;
        for (int i = 0; i < intSizeInBits; ++i) {
            int total1Count = 0, total0Count = 0;    
            for (int j = 0; j < n; ++j) {
                total1Count += (nums[j] & (0x1 << i)) ? 1 : 0;
                //total1Count += (nums[j] >> i) & 0x1;
            }
            total0Count = n - total1Count;
            totalDist += total1Count * total0Count;
        }
        
        return totalDist;
    }
};

代码同步在
https://github.com/luqian2017/Algorithm