Leetcode 461. Hamming Distance JAVA语言

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.

PS:求海明距离。

思路：就是求x和y二进制的异或中的1的个数

public class Solution {public int hammingDistance(int x, int y) {// String x1=Integer.toBinaryString(x);// String y1=Integer.toBinaryString(y);int tem=x^y;int count=0;String str=Integer.toBinaryString(tem);for(int i=0;i<str.length();i++){if(str.charAt(i)=='1'){count++;}}// System.out.println(count);return count;}
}

转载于:https://blog.51cto.com/fulin0532/1888736

Leetcode 461. Hamming Distance JAVA语言相关推荐

[LeetCode] 461. Hamming Distance
The Hamming distance between two integers is the number of positions at which the corresponding bits ...
LeetCode 461 Hamming Distance（汉明距离）
Q:The Hamming distance between two integers is the number of positions at which the corresponding bi ...
LeetCode 461. Hamming Distance
题目: The Hamming distance between two integers is the number of positions at which the corresponding ...
【LeetCode】461. Hamming Distance （java实现）
2019独角兽企业重金招聘Python工程师标准>>> 原题链接 https://leetcode.com/problems/hamming-distance/ 原题 The Ham ...
461. Hamming Distance【数学|位运算】
2017/3/14 15:23:55 The Hamming distance between two integers is the number of positions at which the ...
LeetCode之Hamming Distance
1.题目 The Hamming distance between two integers is the number of positions at which the corresponding ...
LeetCode之461. Hamming Distance
------------------------------------------------------------------ AC代码: public class Solution {publ ...
leetcode 461. 汉明距离（Java版）
题目 https://leetcode-cn.com/problems/hamming-distance/ 题解使用 Java 中的按位异或 ^ 运算符:https://www.baeldung.c ...
LeetCode（191 461）：位1的个数 Number of 1 Bits 汉明距离 Hamming Distance（Java）
2019.9.14 #程序员笔试必备# LeetCode 从零单刷个人笔记整理(持续更新) github:https://github.com/ChopinXBP/LeetCode-Babel 之前在 ...

Leetcode 461. Hamming Distance JAVA语言

Leetcode 461. Hamming Distance JAVA语言相关推荐

最新文章

热门文章