62. Unique Paths
来源:互联网 发布:欧洲卡车模拟2优化 编辑:程序博客网 时间:2024/05/20 21:20
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?
这是一道简单的动态规划题目:
定义一个二维数组sol[m][n],最后数值为 sol[m-1][n-1],然后初始化数组,sol[0][i]=1,sol[i][0]=1,递推关系为sol[i][j]=sol[i-1][j]+sol[i][j-1]。
代码见下:
private static int uniquePaths(int m, int n) { if(m<0||n<0) return -1; if(m==0||n==0) return 1; int[][] sol=new int[m][n]; for (int i = 0; i < m; i++) { sol[i][0]=1; } for (int i = 0; i<n; i++) { sol[0][i]=1; } for (int i = 1; i < m; i++) { for (int j = 1; j < n; j++) { sol[i][j]=sol[i-1][j]+sol[i][j-1]; } } return sol[m-1][n-1]; }
阅读全文
0 0
- 62. Unique Paths && 63. Unique Paths II
- 62. Unique Paths \ 63. Unique Paths II
- [LeetCode]62.Unique Paths
- LeetCode --- 62. Unique Paths
- LeetCode 62.Unique Paths
- [Leetcode] 62. Unique Paths
- [leetcode] 62.Unique Paths
- 62. Unique Paths
- [leetcode] 62.Unique Paths
- leetcode 62. Unique Paths
- Leetcode 62. Unique Paths
- [leetcode] 62. Unique Paths
- 62. Unique Paths LeetCode
- 62. Unique Paths
- 62. Unique Paths
- [LeetCode]62. Unique Paths
- 【LeetCOde】62. Unique Paths
- [LeetCode]62. Unique Paths
- 像大牛一样写代码: 31个Android 开发者工具
- 递归6.递归求1*1+2*2+3*3+……+n*n
- 千锋python基础视频-清华尹成
- javaScript--数组(Array)的reduce方法解析
- 编译原理 --绪论
- 62. Unique Paths
- ℃江的开发手册__Android工具篇
- STM32生成bin文件
- Java 变量类型
- Android Studio 拷过来的
- spring中JoinPoint的使用
- [LeetCode463]Island Perimeter岛屿周长问题
- 欢迎使用CSDN-markdown编辑器
- qwb与支教 【容斥】+【二分枚举】