mirror of
https://github.com/devenperez/leetcode.git
synced 2026-06-13 14:57:08 +00:00
Time: 44 ms (46.87%), Space: 14.2 MB (33.36%) - LeetHub
This commit is contained in:
@@ -14,8 +14,9 @@ class Solution:
|
||||
powerSet = []
|
||||
|
||||
for subsetBinary in range(2 ** len(nums)):
|
||||
subset = []
|
||||
subset = [nums[i] for i in range(len(nums)) if (((2 ** len(nums) - 1) - (2 ** i)) | subsetBinary == (2 ** len(nums) - 1))]
|
||||
|
||||
"""
|
||||
# Iterates exactly n times (where n is the number of 1s in the binary string)
|
||||
while subsetBinary > 0:
|
||||
indexOfFirst1 = -(math.floor(math.log2(subsetBinary)) + 1)
|
||||
@@ -23,6 +24,7 @@ class Solution:
|
||||
subset.append(nums[indexOfFirst1])
|
||||
|
||||
subsetBinary -= 2 ** (-indexOfFirst1 - 1)
|
||||
"""
|
||||
|
||||
powerSet.append(subset)
|
||||
|
||||
|
||||
Reference in New Issue
Block a user