LeetCode 461. Hamming Distance (汉明距离)
2017-06-29 04:02
615 查看
The Hamming distance between two integers is the number of positions at which the corresponding bits are different.
Given two integers
xand
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.
题目标签:Bit Manipulation 这道题目给了我们两个int , 让我们找出hamming distance。设一个for loop 循环32次,然后每一次循环,利用 & 1 来取得最后一个bit, 比较x和y是不是相等,不相等的话,增加res的值by 1。再利用 >> 1来移动bits向右一位。
Java Solution:
Runtime beats 57.75%
完成日期:06/28/2017
关键词:Bit Manipulation
关键点:利用 & 1拿到bit, 利用 >> 来移动bits
public class Solution { public int hammingDistance(int x, int y) { int res = 0; for(int i=0; i<32; i++) { if((x & 1) != (y & 1)) res++; x = x >> 1; y = y >> 1; } return res; } }
参考资料:N/A
LeetCode 算法题目列表 - LeetCode Algorithms Questions List
相关文章推荐
- [LeetCode] 461. Hamming Distance 汉明距离
- leetcode_461. Hamming Distance 计算汉明距离,按位异或运算,计算整数的二进制表示中1的个数 java
- [LeetCode]461. Hamming Distance(汉明距离)
- LeetCode--461. Hamming Distance(汉明距离)Python
- 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-python
- [LeetCode] 461. Hamming Distance
- [leetcode, python] Total Hamming Distance 多个数字之间的汉明距离
- [leetcode, python] Total Hamming Distance 多个数字之间的汉明距离
- LeetCode 461. Hamming Distance(Java)
- 【LeetCode】461. Hamming Distance
- Leetcode题解-461. Hamming Distance
- leetcode 461. Hamming Distance