human
Give me a the Python code you requested given the following:
Solve in Python:
Given a set of distinct integers, nums, return all possible subsets (the power set).

Note: The solution set must not contain duplicate subsets.

Example:

Input: nums = [1,2,3]
Output:
[
  [3],
  [1],
  [2],
  [1,2,3],
  [1,3],
  [2,3],
  [1,2],
  []
]
assistant
#Here is the Python code you requested.

class Solution:
     def subsets(self, nums):
         """
         :type nums: List[int]
         :rtype: List[List[int]]
         """
         subsets = [[]]
         for v in nums:
             extra = []
             for s in subsets:
                 extra.append(s+[v])
             subsets += extra
         return subsets