题目链接
法一(回溯法)
public class Solution77 {
private List<List<Integer>> ans;
private List<Integer> path;
public Solution77() {
this.ans = new LinkedList<>();
this.path = new LinkedList<>();
}
private void backtracking(int n, int k, int start) {
if (path.size() == k) {
ans.add(new LinkedList<>(path));
return;
}
for (int i = start; i <= n - (k - path.size()) + 1; i++) {
path.add(i);
backtracking(n, k, i + 1);
path.remove(path.size() - 1);
}
}
public List<List<Integer>> combine(int n, int k) {
backtracking(n, k, 1);
return ans;
}
}
本地测试
lay.showTitle(77);
Solution77 sol77 = new Solution77();
List<List<Integer>> ans77 = sol77.combine(4, 2);
arrayOpt.showIntLists(ans77);