62. Unique Paths
来源:互联网 发布:linux dma中断 编辑:程序博客网 时间:2024/06/08 19:22
题目
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.
题意
机器人可以往右或往下走,求走到终点一共有多少条路径
分析
这道题其实可以用数学方法解决,参考:
class Solution {public: // 一共走(m-1)+(n-1)步, 从其中选择m-1步向下 // 所以总的走法是C(m+n-2, m-1) int uniquePaths(int m, int n) { m--; n--; long long mn = m + n; long long mn_max = max(m, n); long long mn_min = min(m, n); long long c = 1; for (int i = mn_max + 1; i <= mn; i++) { c *= i; } for (int j = 2; j <= mn_min; j++) { c /= j; } return c; }};
但是在锻炼动态规划的能力,所以用动态规划的方法做了一遍
因为只能向右向下走,所以要走到位置(i, j), 上一步可能是上方(i-1, j)和左方(i, j-1)
所以状态转移方程:
dp[i][j] = 1 , i =0&&j=0 (在第一行/第一列上走都只有一种路径)
dp[i][j] = dp[i-1][j] + dp[i][j-1] , i >=1&&j>=1
class Solution {public: int uniquePaths(int m, int n) { vector<vector<int>> dp(m, vector<int>(n, 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
- 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
- google glog 简单使用小结(转)
- 第七讲:作用域.可见性.生存期.全局对象
- 孤儿进程和僵尸进程 父进程没有执行wait就退出了
- 通过协程统计函数被调用次数(附python代码简单实现)
- 进程间的通信---信号灯
- 62. Unique Paths
- 空心三角形
- ES6_数据结合set
- JVM实用参数(三)打印所有XX参数及值
- C++AMP学习(1)-入门
- HDU6223-Infinite Fraction Path
- Kubernetes controller-manager中deployment处理流程源码分析
- SVM多分类问题 libsvm在matlab中的应用
- 小结