477. Total Hamming Distance (Medium)

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:

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.

Hints

Solutions

class Solution {
    public int totalHammingDistance(int[] nums) {
        int sum = 0;
        for(int i = 0; i < 32; i ++){
            int numOfOnes = 0;
            int p = (1 << i);
            for (int num : nums) {
                if ((num & p) > 0) {
                    numOfOnes++;
                }
            }
            sum += ((nums.length - numOfOnes) * numOfOnes);
        }
        return sum;
    }
}
Copyright © iovi.com 2017 all right reserved,powered by GitbookLast Modification: 2019-04-09 12:15:12

results matching ""

    No results matching ""