#477

Total Hamming Distance

specialist · 795 · lc medium +31 · verified · 54.7% accepted · 2,302 likes · top 47%

Description

The Hamming distance between two integers counts the bit positions where they differ.

Given an integer array nums, return the total Hamming distance summed over every pair of integers in the array.

Example 1:

Input: nums = [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).

The answer will be:

HammingDistance(4, 14) + HammingDistance(4, 2) + HammingDistance(14, 2) = 2 + 2 + 2 = 6.

Example 2:

Input: nums = [4,14,4]

Output: 4

Code

1

2

3

class Solution:
    def totalHammingDistance(self, nums: List[int]) -> int:

class Solution:
    def totalHammingDistance(self, nums: List[int]) -> int: