leetcode 461. Hamming Distance 汉明距离 + 位运算
2018-02-08 09:28
441 查看
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.
汉明码,就是位操作
代码如下:
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.
汉明码,就是位操作
代码如下:
#include <iostream> #include <vector> #include <map> #include <set> #include <queue> #include <stack> #include <string> #include <climits> #include <algorithm> #include <sstream> #include <functional> #include <bitset> #include <cmath> using namespace std; class Solution { public: int hammingDistance(int x, int y) { int dist = 0, n = x ^ y; while (n>0) { ++dist; n &= n - 1; } return dist; } };
相关文章推荐
- LeetCode-461. Hamming Distance-位运算
- 【leetCode】461. Hamming Distance
- 【leetcode】【Easy】【461. Hamming Distance】【bit manipulation】
- leetcode461. Hamming Distance
- LeetCode#461. Hamming Distance
- leetcode 461. Hamming Distance python实现
- LeetCode 461. Hamming Distance-Java
- LeetCode 461. Hamming Distance
- LeetCode 简单操作 | 461. Hamming Distance
- Leetcode题解-461. Hamming Distance
- [leetcode]: 461. Hamming Distance
- Leetcode 461. Hamming Distance
- leetcode 461. Hamming Distance
- LeetCode - 461. Hamming Distance
- python--leetcode 461. Hamming Distance
- leetcode 461.Hamming Distance(easy)[位运算]
- Leetcode题解 - 461. Hamming Distance
- LeetCode :【Easy】461. Hamming Distance
- leetcode 461. Hamming Distance
- [LeetCode] 461. Hamming Distance