package leetcode;

/**
 * https://leetcode.com/problems/hamming-distance/
 */
public class Problem461 {
    public int hammingDistance(int x, int y) {
        // TODO
        return 0;
    }

    public static void main(String[] args) {
        Problem461 prob = new Problem461();
        System.out.println(prob.hammingDistance(1, 4)); // 2
    }
}

@@ -156,38 +156,53 @@
     
-// TODO%0A        return
+int xor = x %5E y;%0A        int result =
  0;%0A    
 %7D%0A%0A 
@@ -201,160 +201,116 @@
     
-%7D%0A%0A
     
-public static void main(String%5B%5D args) %7B%0A        Problem461 prob = new Problem461();%0A        System.out.println(prob.hammingDistance(1, 4)); // 2
+while (xor %3E 0) %7B%0A            result += xor & 1;%0A            xor %3E%3E= 1;%0A        %7D%0A        return result;
 %0A   

Solve problem 461