LeetCode 477. Total Hamming Distance

最新推荐文章于 2025-10-17 10:47:49 发布

原创最新推荐文章于 2025-10-17 10:47:49 发布 · 406 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

算法

LeetCode

本文介绍了一种计算一组整数中所有数对间汉明距离之和的方法。通过统计每一对整数在相同位上不同比特的数量来计算汉明距离，并提供了一个Python实现示例。

Problem Statement

(Source) 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.

Solution

class Solution(object):
    def totalHammingDistance(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        n = len(nums)
        ones = [0] * 32
        for i in xrange(n):
            num = nums[i]
            j = 31
            for bit in bin(num)[2:][::-1]:
                ones[j] += int(bit == '1')
                j -= 1
        return sum(ones[i] * (n - ones[i]) for i in xrange(32))

标签

#leetcode