p461

发表于 | 分类于 |

LeetCode p461 Hamming Distance 题解

1.题目：

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.

题意：

输入两个数,输出将他们转化为2进制之后有多少位不同.

2.解题思路:

见代码

3.代码

[title] [] [url] [link text]
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
 
public class Solution {
    public int hammingDistance(int x, int y) {
        int count = 0;
		
		while (x > 0 || y > 0) {
			int a = x % 2;
			int b = y % 2;
			x = x / 2;
			y = y / 2;
			if (a != b)
				count++;
		}

		return count;

    }
}

4.一些总结：