Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- # 79. Subset
- # 这道题要求算出所有的可能,所以要用到递归(backtracking)
- def backtrackSubset(nums, idx, temp, res):
- """
- :param nums: 原始的数组
- :param idx: 下一层递归所开始的位置
- :param temp: 一个temp数组,来handle每一次加进来的值
- :param res: result
- :return:
- """
- res.append(temp[:]) # 每加进来一个数值就能够形成一个subset
- for i in range(idx, len(nums)):
- #idx是当前层所开始的位置, 也就是当上一层是【1】的时候,当前层要从【1】后面一个值加到temp中。
- temp.append(nums[i])
- backtrackSubset(nums, i+1, temp, res) #temp + [nums[i]]会传到下一层,而当前层还是temp
- temp.pop()
- return
- def subsets(nums):
- res = []
- backtrackSubset(nums, 0, [], res)
- return res
- https://www.youtube.com/watch?v=Az3PfUep7gk&feature=youtu.be
Advertisement
Add Comment
Please, Sign In to add comment