状态转移矩阵f[i][j]=f[i-1][j]+f[i][j-1]
转换为一维dp[j]=dp[j]+dp[j-1]
class Solution {
public:
int uniquePaths(int m, int n) {
vector<int>dp(n,0);
dp[0]=1;
for(int i=0;i<m;i++)
{
for(int j=1;j<n;j++)
dp[j]=dp[j]+dp[j-1];
}
return dp[n-1];
}
};
状态转移矩阵f[i][j]=f[i-1][j]+f[i][j-1]转换为一维dp[j]=dp[j]+dp[j-1]
https://leetcode.com/problems/unique-paths/description/ht...
题目 https://leetcode-cn.com/problems/unique-paths/descript...
动态规划 09 https://leetcode-cn.com/problems/unique-paths/[ht...
题目描述 https://leetcode-cn.com/problems/unique-paths/ 思路 我看...
题目地址 https://leetcode-cn.com/problems/unique-paths/[https...
题目地址： https://leetcode-cn.com/problems/unique-paths/[htt...
题目描述 链接：https://leetcode-cn.com/problems/unique-paths/[ht...
https://leetcode-cn.com/problems/unique-paths/ 我的方法一：动态规划...
62. 不同路径[https://leetcode-cn.com/problems/unique-paths/] 思路
本文标题：unique-paths
本文链接：https://www.haomeiwen.com/subject/nfzokctx.html
网友评论