leetcode之unique-paths

最新推荐文章于 2020-10-08 13:57:52 发布

WEW_diger

最新推荐文章于 2020-10-08 13:57:52 发布

阅读量152

点赞数

分类专栏：动态规划专项训练

本文链接：https://blog.csdn.net/qq_33546256/article/details/81676942

版权

动态规划专项训练专栏收录该内容

2 篇文章 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?
这里写图片描述

class Solution {
public:
    int uniquePaths(int m, int n) {
        int map[101][101];
        for(int i=1;i<=n;i++)
            map[1][i]=1;
        for(int i=1;i<=m;i++)
            map[i][1]=1;
        for(int i=2;i<=m;i++)
        {
            for(int j=2;j<=n;j++)
            {
                map[i][j]=map[i-1][j]+map[i][j-1];
            }
        }
        return map[m][n];
    }
};