LeetCode 477. Total Hamming Distance
来源:互联网 发布:暗黑黎明老虎端口 编辑:程序博客网 时间:2024/05/01 23:59
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, 2Output: 6Explanation: In binary representation, the 4 is 0100, 14 is 1110, and 2 is 0010 (justshowing 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
.
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))
0 0
- LeetCode 477. Total Hamming Distance
- 【Leetcode】477. Total Hamming Distance
- LeetCode 477. Total Hamming Distance
- [leetcode] 477. Total Hamming Distance
- LeetCode 477. Total Hamming Distance
- LeetCode 477. Total Hamming Distance
- LeetCode 477. Total Hamming Distance
- Leetcode-477. Total Hamming Distance
- 【LeetCode】 477. Total Hamming Distance
- [leetcode]477. Total Hamming Distance
- LeetCode 477. Total Hamming Distance
- [LeetCode]477. Total Hamming Distance
- LeetCode 477. Total Hamming Distance
- Leetcode: 477. Total Hamming Distance
- leetcode 477. Total Hamming Distance
- leetcode 477. Total Hamming Distance
- LeetCode 477. Total Hamming Distance
- leetcode 477. Total Hamming Distance
- 一个程序猿小小的梦想-写在16年底的时候
- gitlab重置root密码
- jQuery笔记-click事件
- FIFO 、LRU、LFU三种算法
- 20个编写现代CSS代码的建议
- LeetCode 477. Total Hamming Distance
- 编辑 Ext 表格(二)——— 编辑表格元素
- BestCoder Round #90 Kblack loves flag
- 统测三总结
- identity和assigned 的区别
- 开发模式学习笔记
- CentOS Mysql安装
- 线程的概念和模型以及与进程的比较
- 简单的JQuery和js做出的霓虹灯(显示RGB值)