forked from gouthampradhan/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
HammingDistance.java
49 lines (36 loc) · 964 Bytes
/
HammingDistance.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
package bit_manipulation;
/**
* Created by gouthamvidyapradhan on 16/12/2017.
* 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.
Solution O(1): XOR (x, y) and count the number of bits set
*/
public class HammingDistance {
/**
* Main method
* @param args
* @throws Exception
*/
public static void main(String[] args) throws Exception{
}
public int hammingDistance(int x, int y) {
int z = (x ^ y);
int count = 0;
for(int i = 0; i < 31; i++){
if((z & (1 << i)) > 0){
count++;
}
}
return count;
}
}