leetcode_461:Hamming Distance(Bit Manipulation)(easy)

标签：number   bin   tween   self   poi   ret   blank   lan   target   

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.

solution:两个数异或后其中1的个数

Python实现

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

leetcode_461:Hamming Distance(Bit Manipulation)(easy)

标签：number   bin   tween   self   poi   ret   blank   lan   target   

原文地址：http://www.cnblogs.com/ytq1016/p/6941469.html