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的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。