【LeetCode】 477. Total Hamming Distance
来源:互联网 发布:udid后台管理系统源码 编辑:程序博客网 时间:2024/05/02 01:13
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
.
public class Solution { public int totalHammingDistance(int[] nums) { int res = 0; for (int i = 0; i < 32; i++) { int count = 0; for (int j = 0; j < nums.length; j++) { count += (nums[j] >> i) & 1; } res += count * (nums.length - count); } return res; }}
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
- 【Linux使用及问题解决】用户登录时显示 -bash-4.2$ 问题
- 关于IE 使用AJAX报错:“Stream ended unexpectedly”的解决方法
- JVM源码分析之FinalReference完全解读
- dede文章页图片调用
- Spring Boot中使用@Async实现异步调用
- 【LeetCode】 477. Total Hamming Distance
- 用递归法实现二分查找
- uart
- Java中4大基本加密算法解析
- Qt程序调试之Q_ASSERT断言
- Memcached 基本配置
- 美赛的几点分享
- hibernate 5.2.6新特性
- 遇到的小问题