Sum of All Subset XOR Totals
The XOR total of an array is defined as the bitwise XOR of all its elements, or 0 if the array is empty.
Given an array nums, return the sum of all XOR totals for every subset of nums.
Note: Subsets with the same elements should be counted multiple times.
An array a is a subset of an array b if a can be obtained from b by deleting some, possibly zero, elements of b.
Example 1
Input
nums = [1,3]Output
6The four subsets have XOR totals 0, 1, 3, and 2, which sum to 6.
Example 2
Input
nums = [5,1,6]Output
28The eight subsets have XOR totals 0, 5, 1, 6, 4, 3, 7, and 2, which sum to 28.
Constraints
- 1 <= nums.length <= 12
- 1 <= nums[i] <= 20