Skip to content

Files

Latest commit

e1abef0 · Mar 17, 2020

History

History
63 lines (28 loc) · 638 Bytes

README_EN.md

File metadata and controls

63 lines (28 loc) · 638 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

...