Week Training: 62 Unique Paths

最新推荐文章于 2024-04-02 11:05:06 发布

richard978

最新推荐文章于 2024-04-02 11:05:06 发布

阅读量159

点赞数

本文链接：https://blog.csdn.net/richard978/article/details/72858549

版权

An easy problem to solve, we have made it before, but didn't realize it's a dp solution.

class Solution {
public:
    int uniquePaths(int m, int n) {
        int dp[105][105];
        for(int i=0;i<100;i++){
            for(int j=0;j<100;j++){
                dp[i][j]=1;
            }
        }
        for(int i=1;i<m;i++){
            for(int j=1;j<n;j++){
                dp[i][j] = dp[i-1][j]+dp[i][j-1];
            }
        }
        return dp[m-1][n-1];
    }
};