1863. Sum of All Subset XOR Totals
Solution Code
C#
publicclassSolution{publicintSubsetXORSum(int[]nums){intn=nums.Length,sum=0;intlimit=(1<<n)-1;for(intmask=1;mask<=limit;mask++){int_xor=0;for(intpos=0;pos<n;pos++){if((mask&(1<<pos))>0){_xor^=nums[pos];}}sum+=_xor;}returnsum;}}C++
classSolution{public:intsubsetXORSum(vector<int>&nums){intn=nums.size(),sum=0;intlimit=(1<<n)-1;for(intmask=1;mask<=limit;mask++){int_xor=0;for(intpos=0;pos<n;pos++){if(mask&(1<<pos)){_xor^=nums[pos];}}sum+=_xor;}returnsum;}};Java
classSolution{publicintsubsetXORSum(int[]nums){intn=nums.length,sum=0;intlimit=(1<<n)-1;for(intmask=1;mask<=limit;mask++){int_xor=0;for(intpos=0;pos<n;pos++){if((mask&(1<<pos))>0){_xor^=nums[pos];}}sum+=_xor;}returnsum;}}