[笔记整理]九章算法第一章

[笔记整理]九章算法第一章

1 排列组合模版

1.1 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:  [  [3],  [1],  [2],  [1,2,3],  [1,3],  [2,3],  [1,2],  []]

Solution: Use recursion to construct the solution.

         Tip: Use a tree structure to consider the recursion, e.g.:

{}

{1}    {2}    {3}    {4}

</