osigmao的专栏

public class Solution { public List> combinationSum(int[] candidates, int target) { if (candidates == null || candidates.length == 0) { return null; } Arrays.so

先把digit-letter建个Given a digit string, return all possible letter combinations that the number could represent.

Given two integers n and k, return all possible combinations of k numbers out of 1 ... n.For example,If n = 4 and k = 2, a solution is:[ [2,4], [3,4], [2,3], [1,2], [1,3], [1,4],]

The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or vertically neighboring. The same letter cell may not be used more than once.

还要有多典型的DFS +  backtracking，之前写的乱七八糟凑出来的，后来用了这个si

找到存在的解：DFS + Backtracking因为ji

DFS + BacktrackingII是考虑原set中有重复元素的情况Subset ISubset I