leetcode461 - Hamming Distance - easy

標籤：tput   and   osi   alc   span   nbsp   ++   cal   min   

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.

 

二進位的數位分離。
每次取到最低位來對比。

 

實現：

class Solution {    public int hammingDistance(int x, int y) {        int ans = 0;        while (x > 0 || y > 0) {            if (x % 2 != y % 2) {                ans++;            }            x /= 2;            y /= 2;        }        return ans;    }}

 

leetcode461 - Hamming Distance - easy