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 = 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.

public class Solution {
    public int hammingDistance(int x, int y) {
        int count = 0;
        String str1 = Integer.toBinaryString(x);
        String str2 = Integer.toBinaryString(y);
        int len = 32- str1.length();
        for(int i = 0;i < len;i++){
        	str1 = "0" + str1;
        }
        len = 32- str2.length();
        for(int i = 0;i < len;i++){
        	str2 = "0" + str2;
        }
        for(int i = 0;i < 32;i++){
        	if(str1.charAt(i) != str2.charAt(i)){
        		count++;
        	}
        }
        return count;
    }
}