题目:

题解:
class Solution:
def totalHammingDistance(self, nums: List[int]) -> int:
n = len(nums)
ans = 0
for i in range(30):
c = sum(((val >> i) & 1) for val in nums)
ans += c * (n - c)
return ans

![[单master节点k8s部署]40.安装harbor](https://i-blog.csdnimg.cn/direct/ca9b0868ccbf4b0790f38cb36f29ed0d.png)

















