Subsets

Problem

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

Note:
Elements in a subset must be in non-descending order.
The solution set must not contain duplicate subsets.
For example,
If S = [1,2,3], a solution is:

---

Idea

递归来做就可以，其实对于每一个s[i]来说，只有两个操作，子集包含s[i]和子集不包含s[i].

---

Solution

---