[LeetCode] 78. Subsets

[LeetCode] 78. Subsets

Given a set of distinct integers, nums, return all possible subsets.

Note: The solution set must not contain duplicate subsets.

For example,
If nums = [1,2,3], a solution is:

[    [3],    [1],    [2],    [1,2,3],    [1,3],    [2,3],    [1,2],    []  ]

Thought process:
Iterate through the list. For each number, iterate through the list again starting from that element. As I iterate, add elements to the current list. Delete the last added element after the recurrence.

Read full article from [LeetCode] 78. Subsets