aboutsummaryrefslogtreecommitdiff
path: root/sum_subset_xor.py
blob: 05601976492afb9ec4357ceeaab3c6f4bad3a4a9 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
# 1863. Sum of All Subset XOR Totals
from functools import reduce
from operator import or_

"""
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'. an array 'a' is a subset of an array 'b'
if 'a' can be obtained from 'b' by deleting some elements of 'b'.
"""


class Solution(object):
    def subsetXORSum(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        return reduce(or_, nums) << (len(nums) - 1)


if __name__ == "__main__":
    obj = Solution()
    print(obj.subsetXORSum(nums=[1, 3]))
    print(obj.subsetXORSum(nums=[5, 1, 6]))
    print(obj.subsetXORSum(nums=[3, 4, 5, 6, 7, 8]))