diff options
author | Jack Sangdahl <[email protected]> | 2025-03-16 12:59:18 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-03-16 12:59:18 -0600 |
commit | 27d29594b7a1211d863f38133148842a3285d9e0 (patch) | |
tree | 04afe47aa866d4321a108f6b7c997f7dd8e96fc5 /total_hamming_distance.py | |
parent | a1df0fb34031b85f24094bec64c7660db4479483 (diff) | |
download | leetcode-27d29594b7a1211d863f38133148842a3285d9e0.tar.gz leetcode-27d29594b7a1211d863f38133148842a3285d9e0.zip |
477. total hamming distance
Diffstat (limited to 'total_hamming_distance.py')
-rw-r--r-- | total_hamming_distance.py | 27 |
1 files changed, 27 insertions, 0 deletions
diff --git a/total_hamming_distance.py b/total_hamming_distance.py new file mode 100644 index 0000000..3098372 --- /dev/null +++ b/total_hamming_distance.py @@ -0,0 +1,27 @@ +# 477. Total Hamming Distance + +""" +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'. +""" + + +class Solution(object): + def totalHammingDistance(self, nums): + """ + :type nums: List[int] + :rtype: int + """ + bits = [[0, 0] for _ in range(32)] + for i in nums: + for j in bits: + j[i % 2] += 1 + i /= 2 + return sum(x * y for x, y in bits) + + +if __name__ == "__main__": + obj = Solution() + print(obj.totalHammingDistance(nums=[4, 14, 2])) + print(obj.totalHammingDistance(nums=[4, 14, 4])) |