问题概述
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:
Elements of the given array are in the range of 0 to 10^9
Length of the array will not exceed 10^4.
算法详解
就是算每一个二进制位有多少个1,然后用 ans=(size−quantityOfOne)×quantityOfOne 计算就好。
class Solution {
public:
int totalHammingDistance(vector<int>& nums) {
// int diff = 0;
int size = nums.size();
if(size == 0 || size == 1)return 0;
int max = 0;
for(int i = 0; i != nums.size(); ++i){
if(max < nums[i])max=nums[i];
}
int ans = 0;
while(1){
int diff = 0;
for(int i = 0; i != nums.size(); ++i){
if(nums[i]%2)++diff;
nums[i] >>= 1;
}
max >>= 1;
// std::cout << "max = " << max <<std::endl;
ans += calculate(size, diff);
// std::cout << "diff = " << diff <<std::endl;
if(max == 0)break;
}
return ans;
}
private:
int calculate(int size, int diff){
return (size-diff)*diff;
}
};