跳转至

数组异或和等于 K 的最少操作次数⚓︎

Leetcode题目链接

描述⚓︎

详见中文题目连接。

解答⚓︎

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
class Solution {
public:
    int minOperations(vector<int>& nums, int k) {
        vector<int> oneCnt(32, 0);
        for (int num : nums) {
            for (int i = 0; i < 32; i++) {
                if (num & (1 << i)) oneCnt[i]++;
            }
        }

        int ans = 0;
        for (int i = 0; i < 32; i++) {
            if (k & (1 << i)) {  //if ith bit in k = 1
                if (!(oneCnt[i] % 2)) ans++;
            } else {
                if (oneCnt[i] % 2) ans++;
            }
        }
        return ans;
    }
};