Unique Paths
来源:互联网 发布:大数据方面的项目 编辑:程序博客网 时间:2024/06/05 14:42
-----QUESTION-----
A robot is located at the top-left corner of a
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:
-----SOLUTION-----
class Solution {public: int uniquePaths(int m, int n) { int dp[m][n]; dp[0][0] = 1; for(int i = 0; i< n; i++ ) { dp[0][i] = 1; } for(int i = 0; i< m; i++ ) { dp[i][0] = 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]; }};
0 0
- Unique Paths
- Unique Paths
- Unique Paths
- Unique Paths
- Unique Paths
- Unique Paths
- Unique Paths
- Unique Paths
- Unique Paths
- Unique Paths
- Unique Paths
- Unique Paths
- Unique Paths
- Unique Paths
- Unique Paths
- Unique Paths
- Unique Paths
- Unique Paths
- Winfrom 登录窗体
- mongodb数据库
- 开源框架分类整理
- 黑马程序员--【学习日记四】——java面向对象(二)
- LungoJS框架学习笔记——LungoJS
- Unique Paths
- uva10085 The most distant state(BFS)
- Android中如何在ViewPager中使动态创建的ImageView铺满屏幕
- TreeView 全选的代码
- 去掉DataGridView最后一行的空白行,删除空白行
- 关于ActiveX控件
- ruby 类和模块
- Unique Paths II
- 坐标方位角计算通用公式