LeetCode Total Hamming Distance

最新推荐文章于 2025-10-17 10:47:49 发布
原创 最新推荐文章于 2025-10-17 10:47:49 发布 · 316 阅读 · 0 ·
CC 4.0 BY-SA版权
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
文章标签：

#leetcode

本文介绍了一种计算一组整数间所有可能配对的汉明距离之和的方法。通过逐位对比并利用位运算技巧，有效地解决了问题。文章提供了一个Python实现示例。

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.

# coding=utf-8
import time
import itertools

'''
一次判断数组中所有元素的一位，从低到高。如果某位上，为0的元素有m个，为1的元素有n个，则该位会产生的Hamming distance为m*n个。所有位的依次相加即可
2147483647>10^9
'''


class Solution(object):
    def totalHammingDistance(self, nums):
        """
        :type nums: list[int]
        :rtype: int
        """
        table = [1,
                 2,
                 4,
                 8,
                 16,
                 32,
                 64,
                 128,
                 256,
                 512,
                 1024,
                 2048,
                 4096,
                 8192,
                 16384,
                 32768,
                 65536,
                 131072,
                 262144,
                 524288,
                 1048576,
                 2097152,
                 4194304,
                 8388608,
                 16777216,
                 33554432,
                 67108864,
                 134217728,
                 268435456,
                 536870912,
                 1073741824,
                 2147483648,] #实验表明打表与不打表 在leetcode上排名从击败34.66%到了63.21% (2017.3.19数据)
        s = 0
        for j in xrange(0, 32):
            m = n = 0
            for i in nums:
                if i&table[j] == 0:
                    m += 1
                else:
                    n += 1
            s += m * n
        return s
Hamming Distance (汉明距离)
chouisbo的博客
02-07 7万+
汉明距离
汉明距离（Hamming Distance）
Ruixin1993的博客
03-08 3334
LeetCode 191 Number of 1 Bits计算一个数字的比特位包含1的个数思路1：将其转换成二进制，计算其中1的个数（见下面代码注释部分） 思路2：有个小技巧：value &= value - 1这个运算的结果就是把value最后一个1去掉，循环进行运算直到value等于0（所有的1都被去掉）就可以知道vaule拥有多少个1了public class LeetCode191 {
Leetcode Total Hamming Distance 477
我心中有猛虎 细嗅蔷薇
12-18 937
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 numb
leetcode 477 Total Hamming Distance
朝着梦想前行。
03-26 458
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 nu
LeetCode 477. Total Hamming Distance
luzheqi的专栏
12-24 805
LeetCode 477. Total Hamming Distance
LeetCode: Total Hamming Distance
Lost Monkey
02-09 434
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 giv
leetcode 477. Total Hamming Distance
淡然坊
07-02 424
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 giv
Leetcode 477 Total Hamming Distance
自己的学习笔记
07-02 340
Leetcode 477 Total Hamming Distance#include <vector> #include <intrin.h>//__popcnt #include<nmmintrin.h> using namespace std;class Solution { public: int hammingDistance(int x, int y) { int
leetcode 477. Total Hamming Distance 汉明距离总和
最新发布
邹九的个人博客
10-17 275
本文解决LeetCode 477题汉明距离总和问题，通过计算数组中所有数对之间的汉明距离之和。采用双重循环暴力解法，时间复杂度为O(n²)，空间复杂度O(1)。使用bitset库将数字转换为32位二进制表示，通过异或运算统计不同位数，最终求和返回结果。适用于小规模数据输入，但对于大规模数据效率较低。
477. Total Hamming Distance
wangjun861205的博客
05-02 232
The Hamming distance between two integers is the number of positions at which the corresponding bits are different. Given an integer array nums, return the sum of Hamming distances between all the pairs of the integers in nums. Example 1: Input: nums = [4
LeetCode最全代码
04-09
477 | [Total Hamming Distance](https://leetcode.com/problems/total-hamming-distance/) | [C++](./C++/total-hamming-distance.cpp) [Python](./Python/total-hamming-distance.py) | _O(n)_ | _O(1)_ | Medium ...
优化算法：解决LeetCode中汉明距离总和问题
函数`HammingDistance`用于计算单个数对的汉明距离，而`totalHammingDistance`函数则通过嵌套循环遍历数组，对每对不同的元素调用`HammingDistance`并累加结果。然而，这种方法虽然避免了组合穷举带来的性能瓶颈，但...
LeetCode Best Time to Buy and Sell Stock II
芝兰生于深谷，不以无人而不芳
03-21 4229
Best Time to Buy and Sell Stock II Total Accepted: 41127 Total Submissions: 108434 My Submissions Question Solution Say you have an array for which the ith element is the price of a given stock on da
LeetCode Same Tree
芝兰生于深谷，不以无人而不芳
03-20 4114
Same Tree Total Accepted: 52651 Total Submissions: 125166 My Submissions Question Solution Given two binary trees, write a function to check if they are equal or not.Two binary trees are considered e
LeetCode Reverse Bits
芝兰生于深谷，不以无人而不芳
03-20 3666
Reverse Bits Total Accepted: 8148 Total Submissions: 29905 My Submissions Question Solution Reverse bits of a given 32 bits unsigned integer.For example, given input 43261596 (represented in binary a
LeetCode Rotate Array
芝兰生于深谷，不以无人而不芳
03-20 2490
Rotate Array Total Accepted: 12759 Total Submissions: 73112 My Submissions Question Solution Rotate an array of n elements to the right by k steps.For example, with n = 7 and k = 3, the array [1,2,3,
LeetCode Reverse Integer
芝兰生于深谷，不以无人而不芳
03-20 1961
Reverse Integer Total Accepted: 61132 Total Submissions: 219035 My Submissions Question Solution Reverse digits of an integer.Example1: x = 123, return 321 Example2: x = -123, return -321click to sh
LeetCode Number of 1 Bits
芝兰生于深谷，不以无人而不芳
03-20 1896
Number of 1 Bits Total Accepted: 10567 Total Submissions: 28552 My Submissions Question Solution Write a function that takes an unsigned integer and returns the number of ’1’ bits it has (also known
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值