方法:
1. 递归函数
2. 栈3. 队列
4. 深度优先搜索( DFS , Depth-First Search),又常称为回溯法
5. 广度优先搜索(BFS, Breadth-First Search)
1. Subsets:DFS
public List<List<Integer>> subsets(int[] nums) {
List<List<Integer>> result = new ArrayList<List<Integer>>();
List<Integer> list = new ArrayList<Integer>();
if (nums == null || nums.length == 0) {
return result;
}
Arrays.sort(nums);
dfs(nums, 0, list, result);
return result;
}
private void dfs(int[] nums, int pos, List<Integer> list,List<List<Inte