Unique Paths
来源:互联网 发布:软件里程碑计划模板 编辑:程序博客网 时间:2024/05/27 21:02
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.
题意:有一个m * n的二维数组,求出从(0,0)到(m-1,n-1)有多少条路,每次移动只能向下或向右
思路:
dp算法。
dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
代码:
public static int uniquePaths(int m, int n) { int[][] dp = new int[m][n]; for(int i = 0; i < m; i++) dp[i][0] = 1; for(int j = 0; j < n; j++) dp[0][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]; }
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
- 习题1.16
- 用 Hadoop 计算共生矩阵
- 标准IO库、系统数据文件和信息 - UNIX环境高级编程-第5、6章
- C++实现求字符串的所有的组合
- Fedore解决双显卡切换与驱动问题
- Unique Paths
- 通过spring context和spring MVC context获取bean实例
- MapReduce算法 – 反转排序(Order Inversion)
- 使用Apache Pig时应该注意/避免的操作或事项
- Wait4 & Ptrace & 进程调试 & 子进程状态获取 笔记总结
- MapReduce 算法 —— 二级排序
- 最大似然估计(Maximum likelihood estimation)
- Java 抽象类和接口有什么区别
- DNS解析