unique-paths

最新推荐文章于 2024-10-13 18:33:13 发布

llwjason5555

最新推荐文章于 2024-10-13 18:33:13 发布

阅读量114

点赞数

分类专栏： leetcode 文章标签： leetcode 动态规划

本文链接：https://blog.csdn.net/llwjason5555/article/details/77992527

版权

leetcode 专栏收录该内容

116 篇文章 0 订阅

订阅专栏

题目：

A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram below).
The robot can only move either down or right at any point in time. The robot is trying to reach the bottom-right corner of the grid (marked ‘Finish’ in the diagram below).
How many possible unique paths are there?

这里写图片描述

Above is a 3 x 7 grid. How many possible unique paths are there?
Note: m and n will be at most 100.

程序：

class Solution {
public:
    int uniquePaths(int m, int n) {
        if(m==0&&n==0)
            return 0;
        if(m==0&&n)
            return 1;
        if(m&&n==0)
            return 1;
        vector<vector<int>> dp(m,vector<int>(n,0));
        for(int i=0;i<m;i++)
            for(int j=0;j<n;j++)
                {
                    if(i==m-1||j==n-1)
                        dp[i][j]=1;
                }

         for(int i=m-2;i>=0;i--)
            for(int j=n-2;j>=0;j--)
                {
                    dp[i][j]=dp[i+1][j]+dp[i][j+1];
                }
         return dp[0][0];
    }
};