Package g0401_0500.s0477_total_hamming_distance

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    477 - Total Hamming Distance\.

    Medium

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

    Given an integer array nums, return the sum of Hamming distances between all the pairs of the integers in nums.

    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

    Constraints:

    • <code>1 <= nums.length <= 10<sup>4</sup></code>

    • <code>0 <= numsi<= 10<sup>9</sup></code>

    • The answer for the given input will fit in a 32-bit integer.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer totalHammingDistance(IntArray nums)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait