时间复杂度(O(n*k)),思想:二进制
class Solution:
def subsets(self, nums: [int]) -> [[int]]:
rr = []
for num in range(1 << len(nums)):
r,count = [],0
while num > 0:
if num & 1 == 1:
r.append(nums[count])
num, count = num >> 1, count + 1
rr.append(r)
return rr