Leetcode 题解系列(十)
来源:互联网 发布:开票软件异常000013 编辑:程序博客网 时间:2024/06/16 20:18
62. Unique Path
题目要求
A robot is located at the top-left corner of a
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: int uniquePaths(int m, int n) { int dp[101][101] = {}; for (auto &i : dp) i[0] = 1; for (auto &i : dp[0]) i = 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]; }};
简化
由于计算第i
行的时候,只需要第i - 1
的值,所以dp的数组可以简化为一维数组,空间复杂度变为
class Solution { public: int uniquePaths(int m, int n) { int dp[101] = {}; for (auto &i : dp) i = 1; for (int i = 1; i < n; ++i) { for (int j = 1; j < m; ++j) { dp[j] += dp[j - 1]; } } return dp[m - 1]; }};
63. Unique Path II
题目要求
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
.
Note: m and n will be at most 100.
题目分析
此题与上题类似,但有所不同的是多了有障碍物的条件。
如果一个格子有障碍物,那么通向那个格子的路径数量为0。转移方程为:
时间复杂度为
class Solution { public: int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) { int dp[101] = {}; const int m = obstacleGrid[0].size(), n = obstacleGrid.size(); for (int i = 0; i < m; ++i) { if (obstacleGrid[0][i] == 1) break; dp[i] = 1; } for (int i = 1; i < n; ++i) { dp[0] = obstacleGrid[i][0] == 1 ? 0 : dp[0]; for (int j = 1; j < m; ++j) { dp[j] = obstacleGrid[i][j] == 0 ? dp[j] + dp[j - 1] : 0; } } return dp[m - 1]; }};
- Leetcode 题解系列(十)
- Leetcode 题解系列(一)
- Leetcode 题解系列(二)
- Leetcode 题解系列(三)
- Leetcode 题解系列(四)
- Leetcode 题解系列(五)
- Leetcode 题解系列(六)
- Leetcode 题解系列(七)
- Leetcode 题解系列(八)
- Leetcode 题解系列(九)
- Leetcode 题解系列(十一)
- Leetcode 题解系列(十三)
- Leetcode 题解系列(十二)
- LeetCode OJ题解系列
- LeetCode Single Number系列题解
- LeetCode题解系列--1. Two Sum
- LeetCode题解系列--5. Longest Palindromic Substring
- LeetCode题解系列--684. Redundant Connection
- ADC7608芯片使用
- Python:找到列表中满足某些条件的元素
- 步进电机进阶——控制
- c#--XAML语言介绍
- Vector容器操作与内存分配
- Leetcode 题解系列(十)
- sessionStorage的理解和使用
- GreenDao数据库
- 欢迎使用CSDN-markdown编辑器
- ifconig 网络通过接口侦听局域网内的主机
- Cookie与Session基本知识了解
- 步进电机失步(丢步)的原因和对策
- Slim研读笔记四之Composer(下)
- jquery 返回顶部(插件)