LeetCode 477. Total Hamming Distance
来源:互联网 发布:js弹出div写的确认框 编辑:程序博客网 时间:2024/05/02 01:50
原题网址:https://leetcode.com/problems/total-hamming-distance/
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
.
方法一:穷举搜索,时间复杂度O(N^2),无法通过测试。
方法二:按照比特分组统计。
public class Solution { public int totalHammingDistance(int[] nums) { int total = 0; for(int i = 0, bit = 1; i < 31; i++, bit <<= 1) { int zeros = 0, ones = 0; for(int num : nums) { if ((num & bit) == 0) zeros++; else ones++; } total += zeros * ones; } return total; }}
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
- Leetcode Binary Tree Inorder Traversal
- 第十六章
- LeetCode 461. Hamming Distance
- 【LeetCode】 024. Swap Nodes in Pairs
- Leetcode 26. Remove Duplicates from Sorted Array
- LeetCode 477. Total Hamming Distance
- 【LeetCode】 104. Maximum Depth of Binary Tree
- Leetcode 80. Remove Duplicates from Sorted Array II
- 【LeetCode】 107. Binary Tree Level Order Traversal II
- 用源码解释为什么在Android Studio中Button的文本是大写
- Leetcode Two Sum II - Input array is sorted
- Leetcode 27. Remove Element
- 【LeetCode】 110. Balanced Binary Tree
- 161220