[LeetCode] 461. Hamming Distance

轉自LeetCode

The Hamming distance between two integers is the number of positions at which the corresponding bits are different.

Given two integers x and y, calculate the Hamming distance.

Note:
0 ≤ x, y < 231.

Example:

Input: x = 1, y = 4

Output: 2

Explanation:
1   (0 0 0 1)
4   (0 1 0 0)
       ↑   ↑

The above arrows point to positions where the corresponding bits are different.

<Solution>
這題是要算出有多少位元的值是不一樣的

這時候就可以使用 XOR 配合 bitset 來解

code 如下

	class Solution {
	public:
	int hammingDistance(int x, int y) {
	return bitset<31>(x ^ y).count();
	}
	};

view raw hammingDistance.cpp hosted with ❤ by GitHub