1
class Solution {
2
int sum = 0;
3

4
public int subsetXORSum(int[] nums) {
5
sum = 0;
6
return getAns(nums, 0, 0);
7
}
8

9
int getAns(int[] arr, int i, int cur) {
10
if (i == arr.length) {
11
return cur;
12
}
13
return getAns(arr, i + 1, cur ^ arr[i]) + getAns(arr, i + 1, cur);
14
}
15
}

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0