[LeetCode] 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.

题意，两个数字转为二进制，然后异或一下，判断有多少个1

直接异或判断，简单粗暴

class Solution {private int ham(int num) {int sum = 0;while (num != 0) {if (num%2 == 1)sum ++;num = num/2;}return sum;}public int hammingDistance(int x, int y) {int res = x^y;return ham(res);}
}

转载于:https://www.cnblogs.com/Moriarty-cx/p/9769685.html

[LeetCode] 461. Hamming Distance相关推荐

Leetcode 461. Hamming Distance JAVA语言
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 ...
LeetCode之Hamming Distance
1.题目 The Hamming distance between two integers is the number of positions at which the corresponding ...
461. Hamming Distance【数学|位运算】
2017/3/14 15:23:55 The Hamming distance between two integers is the number of positions at which the ...
LeetCode之461. Hamming Distance
------------------------------------------------------------------ AC代码: public class Solution {publ ...
LeetCode（191 461）：位1的个数 Number of 1 Bits 汉明距离 Hamming Distance（Java）
2019.9.14 #程序员笔试必备# LeetCode 从零单刷个人笔记整理(持续更新) github:https://github.com/ChopinXBP/LeetCode-Babel 之前在 ...
C#LeetCode刷题之#461-汉明距离（Hamming Distance）
问题两个整数之间的汉明距离指的是这两个数字对应二进制位不同的位置的数目. 给出两个整数 x 和 y,计算它们之间的汉明距离. 注意:0 ≤ x, y < 231. 输入: x = 1, y = ...

[LeetCode] 461. Hamming Distance

[LeetCode] 461. Hamming Distance相关推荐

最新文章

热门文章