LeetCode 477. Total Hamming Distance

原题链接在这里：https://leetcode.com/problems/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:

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.

题解：

对于int的32位的每一位，计算在这一位是1的array element个数k, 那么在这一位是0的个数就是nums.length-k. 对于这一位就有k*(nums.length-k)种选法可以产生Hamming Distance. 然后将32位Hamming Distance 个数相加就是总数.

Time Complexity: O(1).

Space: O(1).

AC Java:

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

类似Hamming Distance.