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

Python 3 Code:

class Solution:
    def hammingDistance(self, x, y):
        """
        :type x: int
        :type y: int
        :rtype: int
        """
        z = int (x ^ y)
        ans = 0
        while z > 0:
            ans += z % 2
            z = z >> 1 
            
        return ans

Comments

Post a Comment

Popular posts from this blog

561. Array Partition I

Given an array of  2n  integers, your task is to group these integers into  n  pairs of integer, say (a 1 , b 1 ), (a 2 , b 2 ), ..., (a n , b n ) which makes sum of min(a i , b i ) for all i from 1 to n as large as possible. Example 1: Input: [1,4,3,2] Output: 4 Explanation: n is 2, and the maximum sum of pairs is 4 = min(1, 2) + min(3, 4). Note: n  is a positive integer, which is in the range of [1, 10000]. All the integers in the array will be in the range of [-10000, 10000]. Python 3 Code: class Solution:     def arrayPairSum(self, nums):         """         :type nums: List[int]         :rtype: int         """         nums.sort()         x = 0         for i in range (0,len(nums),2):             x += nums[i]         ret...
Read more

771. Jewels and Stones

You're given strings  J  representing the types of stones that are jewels, and  S  representing the stones you have.  Each character in  S is a type of stone you have.  You want to know how many of the stones you have are also jewels. The letters in  J  are guaranteed distinct, and all characters in  J  and  S  are letters. Letters are case sensitive, so  "a"  is considered a different type of stone from  "A" . Example 1: Input: J = "aA", S = "aAAbbbb" Output: 3 Example 2: Input: J = "z", S = "ZZ" Output: 0 Note: S  and  J  will consist of letters and have length at most 50. The characters in  J  are distinct. Code: class Solution:     def numJewelsInStones(self, J, S):         """         :type J: str         :type S: str         :rtype: int   ...
Read more