leetcode461. Hamming Distance
来源:互联网 发布:8051单片机复位电路 编辑:程序博客网 时间:2024/06/04 19:27
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 = 4Output: 2Explanation:1 (0 0 0 1)4 (0 1 0 0) ↑ ↑The above arrows point to positions where the corresponding bits are different.
public static int hammingDistance(int x, int y) { int res = 0,exc = x ^ y; for (int i=0;i<31;i++){ res+=(exc >> i) & 1; } return res; }
阅读全文
0 0
- [LeetCode461]Hamming Distance
- leetcode461. Hamming Distance
- leetcode461. Hamming Distance
- python--leetcode461 hamming distance
- LeetCode461 Hamming Distance JAVA题解
- Leetcode461. Hamming Distance不要太简单哦
- LeetCode461 Hamming Distance java The Hamming distance between two integers is the number osoluotion
- Hamming Distance
- hamming distance
- hamming distance
- Hamming Distance
- Hamming Distance
- Hamming Distance
- Hamming Distance
- Hamming Distance
- Hamming Distance
- Hamming Distance
- Hamming distance
- CentOS7下安装Nginx
- Ubuntu14.04的ssh免密码登录
- VR视频为什么都是弯的?|VR知识
- 浅谈Glide<入门>
- VS2015 Xamarin使用经验4-SQLite ORM
- leetcode461. Hamming Distance
- session和cookie
- 守护进程(精灵进程)
- lintcode/leetcode由易至难第6题:Number Complement
- docker 构建spark集群
- Multi-Programming-8 线程安全类实现生产者和消费者
- 第十三周 动态规划(三)
- 裁切图片
- Tomcat开启8443端口