Find Xor-Beauty of Array
You are given a 0-indexed integer array nums.
The effective value of three indices i, j, and k is defined as ((nums[i] | nums[j]) & nums[k]).
The xor-beauty of the array is the XORing of the effective values of all the possible triplets of indices (i, j, k) where 0 <= i, j, k < n.
Return the xor-beauty of nums.
Note that:
val1 | val2is bitwise OR ofval1andval2.val1 & val2is bitwise AND ofval1andval2.
Example 1
Input
nums = [1,4]Output
5The xor-beauty is the bitwise XOR of all effective values for the 8 possible triplets, which equals 5.
Example 2
Input
nums = [15,45,20,2,34,35,5,44,32,30]Output
34The xor-beauty of the given array is 34.
Constraints
- 1 <= nums.length <= 10^5
- 1 <= nums[i] <= 10^9