白纸

leetcode 题目链接1. 题目考点dfs 回溯 + 剪枝2. 考点解析数组重复必定先排序 不重复自身必有start 解集不重复比有usedclass Solution { List<List<Integer>> res = new ArrayList<>(); public List<List<Integer>> subsetsWithDup(int[] nums) { Stack&lt

leetcode 题目链接1. 题目考点dfs 回溯找结束条件2. 考点解析结束条件包含在for边界中class Solution { List<List<Integer>> res = new ArrayList<>(); public List<List<Integer>> subsets(int[] nums) { Stack<Integer> path = new Stack&

leetcode题目链接1. 题目考点dfs 回溯 + 剪枝画图分析2. 考点解析数组无重复 + 无重复数字 + 组合无重复class Solution { List<List<Integer>> res = new ArrayList<>(); public List<List<Integer>> combinationSum3(int k, int n) { Stack<Integer&

leetcode题目链接1. 题目考点dfs + 剪枝回溯1. 考点解析回溯 + 剪枝class Solution { List<List<Integer>> res = new ArrayList<>(); public List<List<Integer>> combinationSum(int[] candidates, int target) { Arrays.sort(candidate

leetcode 题目链接1. 题目考点n叉树 dfs回溯+剪枝2. 考点解析回溯 + 两次剪枝class Solution { List<List<Integer>> res = new ArrayList<>(); public List<List<Integer>> combine(int n, int k) { Stack<Integer> combine = new Stac