461. 汉明距离

package leetcode;

public class demo_461 {
    public int hammingDistance(int x, int y) {
        //异或后，不同的值则为1
        int num=x^y;
        int sum=0;
        //转化成求二进制中1的个数
        while(num>0) {
            if(num%2==1) {
                sum=sum+1;
            }
            num=num/2;
        }
        System.out.println(sum);
        return sum;
    }
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        demo_461 demo=new demo_461();
        demo.hammingDistance(1, 4);
    }

}