【一天一道LeetCode】#63. Unique Paths II
来源:互联网 发布:寻找客户资料的软件 编辑:程序博客网 时间:2024/06/07 17:46
一天一道LeetCode
(一)题目
Follow up for “Unique Paths”:
Now consider if some obstacles are added to the grids. How many unique paths would there be?
An obstacle and empty space is marked as 1 and 0 respectively in the grid.
For example,
There is one obstacle in the middle of a 3x3 grid as illustrated below.
[
[0,0,0],
[0,1,0],
[0,0,0]
]
The total number of unique paths is 2.
(二)解题
解题思路:参考上一篇博文【一天一道LeetCode】#62. Unique Paths
class Solution {public: int dp[101][101]; int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) { int row = obstacleGrid.size(); int col = 0; if(row!=0) col = obstacleGrid[0].size(); if(obstacleGrid[0][0]==1) return 0;//起始点不通则直接返回0 for(int i = row-1 ; i>=0 ; i--) for(int j = col-1 ; j>=0 ; j--) { if(obstacleGrid[i][j]==1) dp[i][j] = 0;//代表此路不通 else if(i==row-1&&j==col-1) dp[i][j] = 1;//规定终点的dp为1 else dp[i][j] = dp[i+1][j]+dp[i][j+1]; } return dp[0][0]; }
0 0
- 【一天一道LeetCode】#63. Unique Paths II
- 【一天一道LeetCode】#62. Unique Paths
- LeetCode --- 63. Unique Paths II
- LeetCode 63.Unique Paths II
- [leetcode] 63.Unique Paths II
- [leetcode] 63.Unique Paths II
- Leetcode 63. Unique Paths II
- LeetCode 63. Unique Paths II
- [leetcode] 63. Unique Paths II
- leetcode 63. Unique Paths II
- 63. Unique Paths II LeetCode
- LeetCode 63. Unique Paths II
- [LeetCode]63. Unique Paths II
- leetcode 63. Unique Paths II
- LeetCode *** 63. Unique Paths II
- leetcode 63. Unique Paths II
- Leetcode:63. Unique Paths II
- LeetCode 63. Unique Paths II
- hdu2521:反素数
- java类静态方法测试
- 一些MYSQL查询语句
- shell 生成随机数
- HDOJ 1338 Game Prediction
- 【一天一道LeetCode】#63. Unique Paths II
- win7 win10 通过ipv6上网的方法
- android异常记录
- https在电子邮件安全解决方案
- 给app添加桌面快捷方式
- intval()很重要
- iOS极光推送证书
- js url传值中文乱码之解决
- 第十三周实践项目-阅读、修改和运行关于交通工具类的程序(3)