Description

Subsets

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],
  []
]

求所有子集(幂集),包含一个空集。

Read More

Author's picture

SelFree

城市永远年轻,而我们终将老去

Programer

ChengDu·China