{
  "type": "code_options",
  "author": "https://github.com/qiyuangong/leetcode",
  "source": "solution.md",
  "exercise_id": "391c144d469846e0be425191669a4f33",
  "keywords": "位运算,数组,回溯",
  "title": "子集",
  "desc": [
    {
      "content": "\n<p>给你一个整数数组 <code>nums</code> ，数组中的元素 <strong>互不相同</strong> 。返回该数组所有可能的子集（幂集）。</p><p>解集 <strong>不能</strong> 包含重复的子集。你可以按 <strong>任意顺序</strong> 返回解集。</p><p> </p><p><strong>示例 1：</strong></p><pre><strong>输入：</strong>nums = [1,2,3]<strong><br />输出：</strong>[[],[1],[2],[1,2],[3],[1,3],[2,3],[1,2,3]]</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>nums = [0]<strong><br />输出：</strong>[[],[0]]</pre><p> </p><p><strong>提示：</strong></p><ul>\t<li><code>1 <= nums.length <= 10</code></li>\t<li><code>-10 <= nums[i] <= 10</code></li>\t<li><code>nums</code> 中的所有元素 <strong>互不相同</strong></li></ul>",
      "language": "markdown"
    }
  ],
  "answer": [
    {
      "content": "",
      "language": "python"
    }
  ],
  "prepared": [
    [
      {
        "content": "",
        "language": "python"
      }
    ],
    [
      {
        "content": "",
        "language": "python"
      }
    ],
    [
      {
        "content": "",
        "language": "python"
      }
    ]
  ],
  "template": {
    "content": "class Solution(object):\n\tdef subsets(self, nums):\n\t\tnums.sort()\n\t\tres = [[]]\n\t\tfor index in range(len(nums)):\n\t\t\tsize = len(res)\n\t\t\tfor j in range(size):\n\t\t\t\tcurr = list(res[j])\n\t\t\t\tcurr.append(nums[index])\n\t\t\t\tres.append(curr)\n\t\treturn res\nif __name__ == \"__main__\":\n\ts = Solution()\n\tprint (s.subsets([1,2,3]))",
    "language": "python"
  },
  "node_id": "dailycode-a7329b367a72496381d22bcbc15b0ab1",
  "license": "csdn.net",
  "created_at": 1637894159,
  "topic_link": "https://bbs.csdn.net/topics/600469824"
}