随笔分类 - dfs

leetcode39_组合求和

摘要：public List<List<Integer>> combinationSum(int[] candidates, int target) { List<List<Integer>> ans = new ArrayList<>(); List<Integer> combine = new Arr 阅读全文

posted @ 2022-02-12 23:16 明卿册阅读(19) 评论(0) 推荐(0) 编辑

leetcode39.组合求和

摘要：``java public List<List> combinationSum(int[] candidates, int target) { List<List> ans = new ArrayList<>(); List combine = new ArrayList<>(); dfs(cand 阅读全文

posted @ 2022-02-01 20:18 明卿册阅读(29) 评论(0) 推荐(0) 编辑

leetcode64.最小路径和

摘要：`private int m,n; private int[] dx = {-1, 0, 1, 0}; private int[] dy = {0, -1, 0, 1}; public int minPathSum(int[][] grid) { m = grid.length; n = grid[ 阅读全文

posted @ 2022-02-01 18:10 明卿册阅读(24) 评论(0) 推荐(0) 编辑