leetcode(461) Hamming Distance 简单题

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 = 4Output: 2Explanation:1   (0 0 0 1)4   (0 1 0 0)       ↑   ↑The above arrows point to positions where the corresponding bits are different.

  就是比较两个数 二进制位几个位不同

public class Solution {    public int hammingDistance(int x, int y) {        int count=0;        while(x>0||y>0){            int lastx = x&1;            int lasty = y&1;            int result = lastx^lasty;            int last_result = result&1;            if(last_result==1){                count++;            }            x>>=1;            y>>=1;        }        return count;    }}