首页 > 代码库 > LeetCode之461. Hamming Distance

LeetCode之461. Hamming Distance

技术分享

------------------------------------------------------------------

 

AC代码:

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

 

 

题目来源: https://leetcode.com/problems/hamming-distance/

 

LeetCode之461. Hamming Distance