leetcode 461. Hamming Distance
来源:互联网 发布:ubuntu流量监控 编辑:程序博客网 时间:2024/05/16 11:31
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.
汉明码,就是位操作
代码如下:
#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; }};
阅读全文
0 0
- 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
- Leetcode 461. Hamming Distance
- LeetCode--461. Hamming Distance
- 461. Hamming Distance [LeetCode]
- [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
- [LeetCode]461.Hamming Distance
- MTK6517平台0309camera模块驱动、设备、总线结构笔记
- C#世界探索之路
- node项目
- 初学自定义View
- ubuntu 安装 mongo
- leetcode 461. Hamming Distance
- poj2352——Stars
- sparkRDD
- 使用Git工作的一般流程
- 蓝桥杯——Java基础(进制)
- Android实现后台播放音乐(Service方式)
- Capstone训练营4
- JAVA数组
- mac osx up brew xcrun: error: invalid active developer path