[477] Total Hamming Distance

https://leetcode.com/problems/total-hamming-distance/description/

• algorithms
• Medium (48.07%)
• Source Code: 477.total-hamming-distance.py
• Total Accepted: 45.4K
• Total Submissions: 93.1K
• Testcase Example: '[4,14,2]'

The Hamming distance between two integers is the number of positions at which the corresponding bits are different.

Now your job is to find the total Hamming distance between all pairs of the given numbers.

Example:

Input: 4, 14, 2

Output: 6

Explanation: In binary representation, the 4 is 0100, 14 is 1110, and 2 is 0010 (just showing the four bits relevant in this case). So the answer will be: HammingDistance(4, 14) + HammingDistance(4, 2) + HammingDistance(14, 2) = 2 + 2 + 2 = 6.

Note:

Elements of the given array are in the range of 0 to 10^9 Length of the array will not exceed 10^4.

class Solution(object):
    def totalHammingDistance(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """

        if not nums or len(nums) == 1: return 0
        summerize0 = [0] * 100
        summerize1 = [0] * 100

        mask = 1

        for i in range(100):
            for n in nums:
                if n & mask:
                    summerize1[i] += 1
                else:
                    summerize0[i] += 1

            mask = mask << 1

        result = 0
        for i in range(100):
            result += summerize0[i] * summerize1[i]

        return result
#
#
# arr = [1337,7331]
# s = Solution()
# print s.totalHammingDistance(arr)