L1：03 - subSets

https://oj.leetcode.com/problems/subsets/

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

/**
 * Copyright: NineChapter
 * - Algorithm Course, Mock Interview, Interview Questions
 * - More details on: http://www.ninechapter.com/
 */

public class Solution {
    public ArrayList<ArrayList<Integer>> subsets(int[] num) {
        ArrayList<ArrayList<Integer>> result = new ArrayList<ArrayList<Integer>>();
        if(num == null || num.length == 0) {
            return result;
        }
        ArrayList<Integer> list = new ArrayList<Integer>();
        Arrays.sort(num);  
        subsetsHelper(result, list, num, 0);

        return result;
    }


    private void subsetsHelper(ArrayList<ArrayList<Integer>> result,<span style="white-space:pre">	</span>//递归定义：找出以pos开头的所有子集
        ArrayList<Integer> list, int[] num, int pos) {

        result.add(new ArrayList<Integer>(list));

        for (int i = pos; i < num.length; i++) {
            list.add(num[i]);<span style="white-space:pre">	</span>//加入pos的数
            subsetsHelper(result, list, num, i + 1);<span style="white-space:pre">	</span>//递归到下一层
            list.remove(list.size() - 1);<span style="white-space:pre">	</span>//扔掉pos
        }
    }
}

【注意1】递归一定要从顶层树形结构去想。不要到stack里面去想底层的调用。

【注意2】递归 == 回溯 == DFS

回溯：一个状态延伸，之后再恢复。（eg. 先加上1，然后再扔掉）