LeetCode之汉明距离

一个非常蠢的办法

public class t {
    public static void main(String[] args) {
        int[] nums=new int[3];
        nums[0]=4;
        nums[1]=14;
        nums[2]=4;
        char k1,k2;
        int count=0;
        int max=0;
        String[] a=new String[nums.length];
        for(int i=0;i<nums.length;i++){
            a[i]=Integer.toBinaryString(nums[i]);
            if(a[i].length()>max){
                max=a[i].length();
            }
        }
        for (int i=0;i<a.length;i++){
            while (a[i].length()!=max){
                a[i]='0'+a[i];
            }
        }
        for (int i=0;i<a.length-1;i++){
            for (int j=i+1;j<a.length;j++){
                for(int k=0;k<max;k++){
                    k1=a[i].charAt(k);
                    k2=a[j].charAt(k);
                    if(k1!=k2){
                        count++;
                    }
                }
            }
        }
        System.out.println(count);
    }
}

 后来在网上看见很厉害的办法

        int res = 0;
        int len = nums.length;
        for(int i = 0; i < 30; i++){
            int oneCount = 0;
            int temp = 0;
            for(int j = 0; j < len; j++){
                oneCount += nums[j] & 1;
                nums[j] >>= 1;
                temp += nums[j] == 0 ? 1 : 0;
            }
            res += oneCount * (len - oneCount);
            if(temp == len)break;
        }
        return res;

继续努力