leetcode

0 class Solution {

1 public:

2 long long beautifulSubarrays(const vector<int> &nums) const {

3 static int count[1048577];

4 long long res = 0;

5 int crnt = 0;

6

7 memset(count, 0x00, sizeof(count));

8 count[0] = 1;

9 for (const int n : nums) {

10 crnt ^= n;

11 res += count[crnt]++;

12 }

13

14 return res;

15 }

16 };