回溯
Candy_Rainbow_
这个作者很懒,什么都没留下…
展开
-
JS 力扣刷题 113. 路径总和 II
var pathSum = function(root, targetSum) { let answers = []; let answer = []; const backtrack = (t, n) => {//回溯 if(!t)return; //走到空节点时添加答案,但是叶子节点左右节点都为空,所以有重复解,想办法去重 if(!t.left && !t.right && n == t.va.原创 2022-04-27 13:56:11 · 159 阅读 · 0 评论 -
JS力扣刷题 93. 复原 IP 地址
var restoreIpAddresses = function(s) { let answers = []; let answer = []; function backtrack(index, start){ if(index == 4)//走到最后一层 if(start == s.length){//走到了最后一个字符 answers.push(answer.join('.')); .原创 2022-04-17 22:08:08 · 442 阅读 · 0 评论 -
JS力扣刷题 90. 子集 II
var subsetsWithDup = function(nums) { //先排序 nums = nums.sort(function(a, b){ return a - b; }); let used = new Array(nums.length).fill(0); let answers = []; let answer = []; function backtrack(index, start){ if(i.原创 2022-04-17 11:00:50 · 163 阅读 · 0 评论 -
JS力扣刷题78. 子集
var subsets = function(nums) { let answer = []; let answers = []; function backtrack(index, start){ if(index <= nums.length)answers.push([...answer]); for(let i = start; i <= nums.length - 1; i++){ answer.push.原创 2022-04-14 01:12:14 · 144 阅读 · 0 评论 -
JS力扣刷题77. 组合
var combine = function(n, k) { let answers = []; let answer = []; function backtrack(index, start){ if(index == k)answers.push([...answer]); for(let i = start; i <= n; i++){ answer.push(i); backtrack(.原创 2022-04-14 00:48:51 · 149 阅读 · 0 评论 -
JS力扣刷题47. 全排列 II
var permuteUnique = function(nums) { nums = nums.sort(function(a, b){ return a - b; }); let answer = []; let answers = []; let used = new Array(nums.length).fill(0); function backtrack(index){ if(index > nums.len.原创 2022-04-08 16:25:22 · 489 阅读 · 1 评论 -
JS力扣刷题40. 组合总和 II
思路var combinationSum2 = function(candidates, target) { candidates = candidates.sort(function(a,b){ return b - a; }) let anwser = []; let anwsers = []; let used = new Array(candidates.length).fill(0); let sum = 0; func原创 2022-04-07 18:10:25 · 274 阅读 · 0 评论 -
JS力扣刷题39. 组合总和
思路var combinationSum = function(candidates, target) { var answers = []; var answer = []; var backtrack = function(sum, start){ if(sum > target){ return; } if(sum == target){ //answer.pus原创 2022-04-07 13:42:53 · 177 阅读 · 0 评论