René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"DiscussionForumPosting","headline":"【0097_Week08】学习总结","articleBody":"动态规划（动态递推）\r\n\r\n1. 将复杂问题拆分为多个子问题\r\n2. 分治+最优子结构\r\n3. 顺推：动态递推\r\n\r\nDP顺推模板\r\n```\r\nfunction dp(){\r\n    dp = [][] #二维情况\r\n    \r\n    for(int i = 0;i\u003cM;i++){\r\n        for(int j = 0;j\u003cN;j++){\r\n            dp[i][j] = _function(dp[i'][j']])\r\n        }\r\n    }\r\n    retrun dp[M][N]\r\n}\r\n```\r\n\r\n\r\n关键点：\r\n动态规划和递推或者分支没哟根本上的区别（关键看有无最优的子结构）\r\n拥有共性：找到重复子问题\r\n\r\n不同路径2的PD方程\r\n`grid[i][j] = getPath(obstacleGrid, grid, m, n, i + 1, j) + getPath(obstacleGrid, grid, m, n, i, j + 1);`\r\n\r\n","author":{"url":"https://github.com/JiangJiang77","@type":"Person","name":"JiangJiang77"},"datePublished":"2020-03-01T09:36:05.000Z","interactionStatistic":{"@type":"InteractionCounter","interactionType":"https://schema.org/CommentAction","userInteractionCount":0},"url":"https://github.com/1271/algorithm005-class02/issues/1271"}