Number of Unique XOR Triplets I
You are given an integer array nums of length n, where nums is a permutation of the numbers in the range [1, n].
A XOR triplet is defined as the XOR of three elements nums[i] XOR nums[j] XOR nums[k] where i <= j <= k.
Return the number of unique XOR triplet values from all possible triplets (i, j, k).
Example 1
Input
nums = [1,2]Output
2The unique XOR values from all triplets are {1, 2}, so the output is 2.
Example 2
Input
nums = [3,1,2]Output
4The unique XOR values from all triplets include {0, 1, 2, 3}, so the output is 4.
Constraints
- 1 <= n == nums.length <= 10^5
- 1 <= nums[i] <= n
- nums is a permutation of integers from 1 to n.