题目:
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.
思路:
考虑所有数字的同一个bit位,统计在这个bit位上出现的1的次数count,那么这个bit位在总的汉明距离中就贡献了count*(n-count),n是数组中元素的个数。
程序:
class Solution {
public:
int totalHammingDistance(vector<int>& nums) {
int total = 0, n = nums.size();
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;
}
};