leetcode 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.

要是计算每一组的值那肯定是超时的。。。

分析后可以从每一位上着手，一个位置上为1和为0的数的乘积就是这一位上贡献的距离数

public class Solution {
    public int totalHammingDistance(int[] nums) {
        if(nums.length<2) return 0;
        int ans = 0;
        int[] cnt = new int[32];
        for(int num : nums){
            int i=0;
            while(num>0){
                cnt[i++] += num & 1;
                num >>= 1;
            }
        }
        for(int i=0; i<32; i++){
            ans += (nums.length - cnt[i]) * cnt[i];
        }
        return ans;
    }
}