LeetCode477. 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, 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:

  1. Elements of the given array are in the range of to 10^9
  2. Length of the array will not exceed 10^4.
class Solution {
public:
	int totalHammingDistance(vector<int>& nums) {
		int ans = 0, len=nums.size();
        unsigned int mask = 1;
		for (int i = 0; i < 32; i++) {
			int count = 0;
			for (int n : nums) {
				if (n & mask) count++;
			}
			ans += (count) * (len - count);
            mask = mask << 1;
		}
		return ans;
	}
};

 

发布了526 篇原创文章 · 获赞 48 · 访问量 9万+
展开阅读全文

没有更多推荐了,返回首页

©️2019 CSDN 皮肤主题: 技术黑板 设计师: CSDN官方博客

分享到微信朋友圈

×

扫一扫,手机浏览