Unique Paths
来源:互联网 发布:淘宝折也怎么报名 编辑:程序博客网 时间:2024/06/07 08:17
题目描述:
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.
解题思路:
使用动态规划,dp[i][j]表示从起点(0,0)到(i,j)的不同路径的数目,由于只能向右和向下移动,
所以状态转移方程为:dp[i][j]=dp[i-1][j]+dp[i][j-1],最后的dp[m-1][n-1]即为所求。
AC代码如下:
class Solution {public:int uniquePaths(int m, int n) {if (m <= 0 || n <= 0) return 0;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
- 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
- php两个数字进行比较大小
- Windows下设备GUID常识
- listView基本设置
- HDU 5726 GCD (DP+二分)
- caffe学习(1):安装配置ubuntu14.04+cuda7.5+caffe+cudnn
- Unique Paths
- HTML5前端开发之进阶篇
- AsyncTask(异步)和Thread(线程)的使用与对比
- 把数组排成最小的数
- 使用Toolbar + DrawerLayou实现菜单侧滑,改变toolbar左上角图标
- ServletContext容器,网站访问量
- Java swing
- <C++略识>之浅拷贝与深拷贝
- Maven为web项目同时打jar和war包,deploy时只上传jar包的配置