LeetcodeSumOfAllSubsetXorTotals.java

/** Leetcode - 1863. Sum of All Subset XOR Totals(https://leetcode.com/problems/sum-of-all-subset-xor-totals/)
Question:The XOR total of an array is defined as the bitwise XOR of all its elements, or 0 if the array is empty.
For example, the XOR total of the array [2,5,6] is 2 XOR 5 XOR 6 = 1.
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.
*/

classSolution {
intsum=0;

publicintsubsetXORSum(int[] n) {
if(n.length==1){
returnn[0];
 }
elseif(n.length==2){
return (n[0]+n[1]+n[0]^n[1]);
 }
booleanb[]=newboolean[n.length];
Arrays.fill(b,false);
inta=0;
ints=0;
s+=n[0];
Stringst="";
for(inti=1;i<n.length;i++){
s+=n[i];
sum=0;
a=xor(n,0,i+1,b,0,-1,st);
s+=a; 
 }
returns;
 }
publicintxor(int[] n,intco, intte,boolean[] b, ints,intli, Stringst){
if(co==te){
sum+=s;
returns;
 }
for(inti=li+1;i<n.length;i++){
if(b[i]==false){
b[i]=true;
intx=s;
s=s^n[i];
inta=xor(n,co+1,te,b,s,i,st+" "+n[i]);
s=x;
b[i]=false;
 }
 }
returnsum;
 }
}