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:

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

方法0: brute force, TLE

Complexity

Time complexity: O(n^2)
Space complexity: O(1)

方法1: bitwise

思路：

按照brute force以单词和单词的角度统计超时，那么就换成以bitwise的角度统计。也就是说，每一次我们看所有数字上某一bit，如果说遍历一次发现了k个1，n - k个0，那么在这一位能contribute的hamming distance就是k * (n - k)。这样复杂度只有O(n), 遍历32次。

Complexity

Time complexity: O(n)
Space complexity: O(1)

class Solution {
public:
    int totalHammingDistance(vector<int>& nums) {
        int result = 0;
        int n = nums.size();
        for (int i = 0; i < 32; i++) {
            int ones = 0;
            for (int num: nums) {
                if ((1 << i) & num) ones++;
                
            }
            result += ones * (n - ones);
        }
        return result;
    }
};

易错点

1. 1 << i 和 i >> 1意义不一样。还有 i << 1。 a << b：a向左shift b次