rustgym/leetcode/
_1310_xor_queries_of_a_subarray.rs1struct Solution;
2
3impl Solution {
4 fn xor_queries(mut arr: Vec<i32>, queries: Vec<Vec<i32>>) -> Vec<i32> {
5 let n = arr.len();
6 for i in 1..n {
7 arr[i] ^= arr[i - 1];
8 }
9 let mut res = vec![];
10 for query in queries {
11 let l = query[0] as usize;
12 let r = query[1] as usize;
13 let x = if l > 0 { arr[r] ^ arr[l - 1] } else { arr[r] };
14 res.push(x);
15 }
16 res
17 }
18}
19
20#[test]
21fn test() {
22 let arr = vec![1, 3, 4, 8];
23 let queries = vec_vec_i32![[0, 1], [1, 2], [0, 3], [3, 3]];
24 let res = vec![2, 7, 14, 8];
25 assert_eq!(Solution::xor_queries(arr, queries), res);
26 let arr = vec![4, 8, 2, 10];
27 let queries = vec_vec_i32![[2, 3], [1, 3], [0, 0], [0, 3]];
28 let res = vec![8, 0, 4, 4];
29 assert_eq!(Solution::xor_queries(arr, queries), res);
30}