您当前位置：首页 > php开源 > php教程 > Leetcode 62 Unique Paths

Leetcode 62 Unique Paths

来源：程序员人生发布时间：2016-11-21 08:40:59 阅读次数：2119次

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.

DP基础题，不多说了，左和上方转移

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

生活不易，码农辛苦
如果您觉得本网站对您的学习有所帮助,可以手机扫描二维码进行捐赠
程序员人生

------分隔线----------------------------

上一篇 如何在百宝云应用中心发布自己的应用

下一篇 Android官方开发文档Training系列课程中文版：电池续航时间优化之监测电池电量及充电状态

分享到:

------分隔线----------------------------

为码而活

积分：4237

15粉丝

7关注

栏目热点