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
to10^9
- Length of the array will not exceed
10^4
.
Subscribe to see which companies asked this question.
思路:计算所有数同一位中1的个数numone,然后总数num = num+numone*(nums.length-numone);
public class Solution {
public int totalHammingDistance(int[] nums) {
int num = 0;
if (nums.length == 0 || nums.length == 1) {
return 0;
}
int numzero = 0, numone = 0, max = nums[0], maxnum = 0;
for (int i = 1; i < nums.length; i++) {
if (nums[i] > max) {
max = nums[i];
maxnum = i;
}
}
while (nums[maxnum] > 0) {
numone = 0;
for (int i = 0; i < nums.length; i++) {
int k = nums[i] & 0x1;
numone = numone + k;
nums[i] >>= 1;
}
num = num + numone * (nums.length - numone);
}
return num;
}
}