leetcode

0 class Solution {

1 public:

2 vector<int> xorQueries(const vector<int> &arr, const vector<vector<int>> &q) {

3 const int n = arr.size(), m = q.size();

4 vector<int> sum(n + 1), res(m);

5 for (int i = 0, acc = 0; i < n; i++)

6 sum[i + 1] = acc ^= arr[i];

7 for (int i = 0; i < m; i++)

8 res[i] = sum[q[i][1] + 1] ^ sum[q[i][0]];

9 return res;

10 }

11 };