easy 1 : 461. Hamming Distance
来源:互联网 发布:山东网络作家协会 编辑:程序博客网 时间:2024/06/06 12:50
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.
Subscribe to see which companies asked this question.
“汉明距离”,一个较为著名的问题,给定两个整数,求出这两个数字的二进制中位数不同的个数。比如上面的1和4,在第0位和第2位数字不同,因此这个汉明距离就是2。
public class Solution {
public int hammingDistance(int x, int y) {
int z = x ^ y;//异或
int res = 0;
while(z != 0) {
if(z%2 == 1) {
res ++;
}
z >>= 1;
}
return res;
}
}
阅读全文
1 0
- easy 1 : 461. Hamming Distance
- [easy]461. Hamming Distance
- 461. Hamming Distance 难度:easy
- LeetCode :【Easy】461. Hamming Distance
- leetcode 461.Hamming Distance(easy)[位运算]
- 【leetcode】【Easy】【461. Hamming Distance】【bit manipulation】
- 461. Hamming Distance#1
- LeetCode 461. Hamming Distance
- 461. Hamming Distance
- 【Leetcode】461. Hamming Distance
- 461. Hamming Distance
- LeetCode 461. Hamming Distance
- 461. Hamming Distance
- LeetCode - 461. Hamming Distance
- 461. Hamming Distance*
- LeetCode-461. Hamming Distance
- 461. Hamming Distance
- 【LeetCode】 461. Hamming Distance
- MVVM模式的简单案例
- Spring不能直接@autowired注入Static变量
- svn的merge使用例子
- 安霸(ambarella) s2lm视频处理流程
- java多态
- easy 1 : 461. Hamming Distance
- CUDA存储器详解
- 缓存、缓存算法和缓存框架比较
- 聪明的老板才不招工资低的程序员
- Codeforces 808C Tea Party 题解
- kafka
- eclipse主题
- 数据库索引
- 记录一次kernel内存泄漏的查找定位过程