美文网首页
Hamming Distance

Hamming Distance

作者: yatttto | 来源:发表于2017-03-13 15:02 被阅读0次

    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.
    Example:

    Input: x = 1, y = 4
    
    Output: 2
    
    Explanation:
    1   (0 0 0 1)
    4   (0 1 0 0)
           ↑   ↑
    
    The above arrows point to positions where the corresponding bits are different.
    

    我们可以先做位操作,然后将其转为二进制求出1的个数。
    代码如下:

    class Solution(object):
        def hammingDistance(self, x, y):
            """
            :type x: int
            :type y: int
            :rtype: int
            """
            return bin(x^y).count('1')
    

    相关文章

      网友评论

          本文标题:Hamming Distance

          本文链接:https://www.haomeiwen.com/subject/qdofnttx.html