动态规划
Candy_Rainbow_
这个作者很懒,什么都没留下…
展开
-
JS 力扣刷题 120. 三角形最小路径和
var minimumTotal = function(triangle) { //动态规划 let answers = []; answers.push(triangle[0]); for(let i = 1; i < triangle.length; i++){ let answer = new Array(triangle[i].length); answer[0] = answers[i - 1][0] + triangle[i.原创 2022-04-29 12:54:49 · 186 阅读 · 0 评论 -
JS力扣刷题 97. 交错字符串
思路var isInterleave = function(s1, s2, s3) { if(s1.length + s2.length != s3.length)return false; let m = s1.length; let n = s2.length; let res = Array.from(Array(m + 1), () => new Array(n + 1).fill(false)); res[0][0] = true; fo原创 2022-04-18 11:52:11 · 197 阅读 · 0 评论 -
JS力扣刷题 96. 不同的二叉搜索树
思路var numTrees = function(n) { let res = new Array(n + 1); res[0] = 1; res[1] = 1; for(let i = 2; i <= n; i++){ let tmp = 0; for(let j = 0; j < i; j++) tmp += res[j] * res[i - 1 - j]; res[i] = tm原创 2022-04-18 10:39:03 · 131 阅读 · 0 评论 -
JS 力扣刷题 91. 解码方法
思路原创 2022-04-17 18:12:15 · 238 阅读 · 0 评论 -
JS力扣刷题64. 最小路径和
var minPathSum = function(grid) { let m = grid.length, n = grid[0].length; let res = Array.from(Array(m), () => new Array(n).fill(0)); //动态规划填表 //初始化最后一行和最后一列 res[m - 1][n - 1] = grid[m - 1][n - 1]; for(let j = n - 2; j >= 0;.原创 2022-04-12 00:41:10 · 622 阅读 · 0 评论 -
JS力扣刷题63. 不同路径 II
var uniquePathsWithObstacles = function(obstacleGrid) { //获得长宽m, n let m = obstacleGrid.length, n = obstacleGrid[0].length; //障碍物在起始和结束点直接返回0 if(obstacleGrid[0][0] == 1 || obstacleGrid[m - 1][n - 1] == 1)return 0; //动态规划表格 let res .原创 2022-04-11 23:56:32 · 765 阅读 · 0 评论 -
JS力扣刷题62. 不同路径
var uniquePaths = function(m, n) { //递归超时 // function sum(i,j){ // if(i == m - 1 || j == n - 1)return 1; // return sum(i + 1, j) + sum(i, j + 1); // } // return sum(0,0); //按照递归的思想 动态规划 let res = Array.from(Arr.原创 2022-04-11 22:09:19 · 358 阅读 · 0 评论