leetcode

0 class Solution {

1 public:

2 int subsetXORSum(const vector<int> &nums) const {

3 const int n = size(nums);

4 int res = 0;

5

6 for (uint16_t mask = 1; mask < (1 << n); mask++) {

7 uint16_t crnt = mask, acc = 0;

8 while (crnt) {

9 const uint8_t idx = countr_zero(crnt);

10 acc ^= nums[idx];

11 crnt ^= 1 << idx;

12 }

13 res += acc;

14 }

15

16 return res;

17 }

18 };