Skip to content

Latest commit

 

History

History
61 lines (31 loc) · 698 Bytes

README_EN.md

File metadata and controls

61 lines (31 loc) · 698 Bytes

中文文档

Description

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

  []

]

Solutions

Python3

Java

...