spacepaste

Paste details

reply | raw

  1.  
  2. class Solution:
  3. def subsets_recursive(self, nums):
  4. """
  5. O(n*2^n)
  7. :type nums: List[int]
  8. :rtype: List[List[int]]
  10. Given a set of distinct integers, nums, return all possible subsets (the power set).
  11. Note: The solution set must not contain duplicate subsets.
  13. Example:
  15. Input: nums = [1,2,3]
  16. Output:
  17. [
  18. [3],
  19. [1],
  20. [2],
  21. [1,2,3],
  22. [1,3],
  23. [2,3],
  24. [1,2],
  25. []
  26. ]
  28. """
  29. # [1,2,3], [ [],[1],[2],[3],[1,2],[1,3],[2,3],[1,2,3] ]
  30. res = []
  31. self.generateSet(nums, 0, res, [])
  32. return res
  34. def generateSet(self, nums, startingPos, res, subRes):
  35. res.append(subRes[:])
  36. for i in range(startingPos, len(nums)):
  37. subRes.append(nums[i])
  38. self.generateSet(nums, i + 1, res, subRes)
  39. subRes.pop()
  40.  
Powered by spacepaste. Paste removal.