-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path5th-July-Hamming-Distance.cpp
44 lines (35 loc) · 1.04 KB
/
5th-July-Hamming-Distance.cpp
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
Solution:
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:
class Solution {
public:
int hammingDistance(int x, int y) {
int n = x^y;
int count =0;
while(n>0)
{
n = n&(n-1);
count++;
}
return count;
}
};
-------------------------------------------------------------------------------------------------------------------------------------------------------------------
Done By
Md Mobbasher Ansari
149 / 149 test cases passed.
Status: Accepted
Runtime: 0 ms
Memory Usage: 5.9 MB