Unique Paths
来源:互联网 发布:php网络验证源码 编辑:程序博客网 时间:2024/04/30 11:32
Unique Paths
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.
解题技巧:
从(1,1)到(m, n)需要向下走m步,向右走n步,共有(m+n)! / (m! * n!)种方法,但是m, n<100,故在求阶乘时,存在数据过大问题。本题采用的
解法是动态规划,状态转移方程为A[i][j] = A[i-1][j] + A[i][j-1]
代码:
int uniquePaths(int m, int n){ int A[m][n]; for(int i = 0; i < m; i ++) { for(int j = 0; j < n; j ++) { if(i == 0 || j == 0) A[i][j] = 1; else A[i][j] = A[i-1][j] + A[i][j-1]; } } return A[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
- ECMALL创建模板
- 隐藏excel分组框中的边框
- 认识光源
- java maven项目常用 build配置及启动脚本
- 我的GIT使用笔记
- Unique Paths
- Centos6.5安装zabbix2.4
- 强大的SpannableStringBuilder
- 关于ShareSdk分享新浪微博停止工作问题
- mkfs.ext4 大于2T 的目录
- iOS 怎么删除项目中的多余分支
- 数据结构实训——图书管理系统
- IOS GCD使用求助
- svn使用教程(Mac、Linux)