Leetcode 1310. Subarray XOR query prefix and + XOR

Original link ：Leetcode 1310. Subarray XOR query

The main idea is a ^ b ^b=a

class Solution {
    
public:
    vector<int> xorQueries(vector<int>& arr, vector<vector<int>>& queries) {
    
        int n=arr.size();
        vector<int> sum(n+1,0);
        for(int i=1;i<=n;i++) sum[i]=sum[i-1]^arr[i-1];
        vector<int> res;
        for(int i=0;i<queries.size();i++)
        {
    
            int l=queries[i][0]+1,r=queries[i][1]+1;
            res.push_back(sum[r]^sum[l-1]);
        }
        return res;
    }
};