LeetCode Weekly Contest 13

Total_Hamming_Distance.cpp

class Solution {
public:
    struct node {
        int z, o;

        node() {
            z = o = 0;
        }
    };

    int totalHammingDistance(vector<int>& nums) {
        vector<node> v(32);
        for (auto num : nums) {
            for (int i = 0; i < v.size(); ++i) {
                if (num & 1) {
                    ++v[i].o;
                } else {
                    ++v[i].z;
                }
                num >>= 1;
            }
        }
        int ans = 0;
        for (auto n : v) {
            ans += n.o * n.z;
        }
        return ans;
    }
};