[LeetCode]#1863. Sum of All Subset XOR Totals

Environment: Python 3.8

Key technique: |, pow

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.

Example 1:

Example 2:

Analysis:

  1. Observe example 2, we can see all sunsets are 1, 2, 3, 4, 5, 6, 7.
  2. We can covert it by formula (all bits) x 2^(n-1). n is list number.

Solution:

Submissions:

Reference:

https://leetcode.com/problems/sum-of-all-subset-xor-totals/discuss/1333272/Using-OR-operator

--

--

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store