算法练习(36) leetcode 461. 汉明距离

https://leetcode-cn.com/problems/hamming-distance/

class Solution {
    public int hammingDistance(int x, int y) {
        String stringx=reverse(Integer.toBinaryString(x));
        String stringy=reverse(Integer.toBinaryString(y));
        int ans=0,min=Math.min(stringx.length(),stringy.length());
        for(int i=0;i<min;i++){
            if (stringx.charAt(i)!=stringy.charAt(i)){
                ans++;
            }
        }
        String longer=stringx.length()>stringy.length()?stringx:stringy;
        longer=longer.substring(min);
        ans=ans+longer.length()-longer.replace("1","").length();
        return ans;
    }

    public static String reverse(String string){
        StringBuffer stringBuffer = new StringBuffer(string);
        StringBuffer reversestring = stringBuffer.reverse();
        return reversestring.toString();
    }
}