[LeetCode] 477. Total Hamming Distance 所有汉明距离

2021年09月15日 阅读数:1
这篇文章主要向大家介绍[LeetCode] 477. Total Hamming Distance 所有汉明距离,主要内容包括基础应用、实用技巧、原理机制等方面,希望对大家有所帮助。

The Hamming distance between two integers is the number of positions at which the corresponding bits are different.html

Now your job is to find the total Hamming distance between all pairs of the given numbers.python

Example:post

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:this

  1. Elements of the given array are in the range of to 10^9
  2. Length of the array will not exceed 10^4.

Python:url

class Solution(object):
    def totalHammingDistance(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        result = 0
        for i in xrange(32):
            counts = [0] * 2
            for num in nums:
                counts[(num >> i) & 1] += 1
            result += counts[0] * counts[1]
        return result  

C++:code

class Solution {
public:
    int totalHammingDistance(vector<int>& nums) {
        int res = 0, n = nums.size();
        for (int i = 0; i < 32; ++i) {
            int cnt = 0;
            for (int num : nums) {
                if (num & (1 << i)) ++cnt;
            }
            res += cnt * (n - cnt);
        }
        return res;
    }
};

  

 

相似题目:htm

[LeetCode] 191. Number of 1 Bits 二进制数1的个数blog

[LeetCode] 461. Hamming Distance 汉明距离ip

 

All LeetCode Questions List 题目汇总