LeetCode每日刷题Day7---L461 汉明距离

最新推荐文章于 2020-10-04 20:26:00 发布

想吃猫的小丑鱼

最新推荐文章于 2020-10-04 20:26:00 发布

阅读量125

点赞数

分类专栏： LeetCode每日刷题

本文链接：https://blog.csdn.net/weixin_42252770/article/details/90201867

版权

LeetCode每日刷题专栏收录该内容

22 篇文章 0 订阅

订阅专栏

L461 汉明距离

GitHub 账户：LuvnJoae 欢迎关注！ https://github.com/LuvnJoae
GitHub 代码链接：https://github.com/LuvnJoae/Java_leetcode

思路与结果

在这里插入图片描述

代码

思路1

package Day7_5_13.L461;

public class Solution {
    public int hammingDistance(int x, int y) {
        Integer a = Integer.valueOf(x);
        Integer b = Integer.valueOf(y);

        char[] cs1 = Integer.toBinaryString(a).toCharArray();
        char[] cs2 = Integer.toBinaryString(b).toCharArray();

        int numMin = a < b ?  cs1.length : cs2.length;
        int numMax = a > b ?  cs1.length : cs2.length;
        char[] csMax = a > b ? cs1 : cs2;

        int count = 0;

        for (int i = 1; i <= numMin; i++) {
            if (cs1[cs1.length - i] != cs2[cs2.length-i]){
                count++;
            }
        }
        for (int i = 0; i < (numMax - numMin); i++ ){
            if (csMax[i] != '0'){
                count++;
            }
        }
        return count;
    }
}

思路2

package Day7_5_13.L461;

public class Solution2 {
    public int hammingDistance(int x, int y) {
        return Integer.toBinaryString(x^y).replaceAll("0","").length();
    }
}

思路3

package Day7_5_13.L461;

public class Solution3 {
    public int hammingDistance(int x, int y) {
        int count = 0;
        for (int i = 0; i < 32; i++) {
            count += ( ( x >> i ) & 1 ) ^ ( ( y >> i ) & 1);
        }
        return count;
    }
}