Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- def subsetXORSum(nums: list[int]) -> int:
- size = len(nums)
- def DFS(i: int, xor: int) -> int:
- if i == size:
- return xor
- return DFS(i + 1, xor ^ nums[i]) + DFS(i + 1, xor)
- return DFS(0, 0)
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement