<LeetCode OJ> 62. / 63. Unique Paths(I / II)
Submissions: 214539 Difficulty: Medium
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.
Subscribe to see which companies asked this question
分析:
思路首先:令从(1。1)到(m,n)的最大走法数为dp[m,n]
不论什么一个点都是从上面走下来和从右边走过来两种可能的和
显然dp[m,n]=dp[m-1,n]+dp[m,n-1]
最简单的动态规划问题...........时间复杂度O(M*N)。空间复杂度O(M*N)
class Solution {
public:
int uniquePaths(int m, int n) {
vector< vector<int> > result(m+1);
for(int i=0;i <=m ;i++)
result[i].resize(n+1);//设置数组的大小m+1行,n+1列
for(int i=1;i<=n;i++)
result[1][i]=1;
for(int i=1;i<=m;i++)
result[i][1]=1;
for(int i=2;i<=m;i++)
for(int j=2;j<=n;j++)
result[i][j]=result[i-1][j]+result[i][j-1];
return result[m][n];
}
};
Submissions: 191949 Difficulty: Medium
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.
Subscribe to see which companies asked this question
分析:
思路首先:
此题与原问题相较,变得是什么?
1。此障碍物以下和右边将不在获得来自于此的数量,也能够理解为贡献为0
2。有障碍的地方也将无法到达(这一条開始时没想到。总感觉leetcode题目意思不愿意说得直接明了)。也就是说此点的可到达路劲数直接为0
class Solution {
public:
int uniquePathsWithObstacles(vector<vector<int>>& obstacleGrid) {
int m=obstacleGrid.size();
int n=obstacleGrid[0].size();
vector< vector<int> > result(m+1);
for(int i=0;i <=m ;i++)
result[i].resize(n+1);//设置数组的大小m+1行。n+1列
//初始化一定要正确。否则错无赦
result[1][1]= obstacleGrid[0][0]==1? 0:1;
for(int i=2;i<=n;i++)
result[1][i]=obstacleGrid[0][i-1]==1?0:result[1][i-1];//由上一次来推到
for(int i=2;i<=m;i++)
result[i][1]=obstacleGrid[i-1][0]==1?0:result[i-1][1]; for(int i=2;i<=m;i++)
for(int j=2;j<=n;j++)
result[i][j]=obstacleGrid[i-1][j-1]==1?0:result[i-1][j]+result[i][j-1]; //一旦当前有石头就无法到达,直接置零 return result[m][n];
}
};
联动另外一个问题:
Submissions: 183284 Difficulty: Medium
Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.
Note: You can only move either down or right at any point in time.
Subscribe to see which companies asked this question
分析:
非常显然的动态规划问题。
令从原点(1,1)到目的点(m,n)的最小路劲和为result[m,n]
不论什么一个点的路劲和都是来自二维数组上一行的最小路劲和或者来自右一列的最小路劲和与当前位置的值相加的结果 显然result[m,n]=min(result[m-1,n]+grid[m,n],result[m,n-1]+grid[m,n])
注意初始化问题
class Solution {
public:
int minPathSum(vector<vector<int>>& grid) {
int row=grid.size();//行
int col=grid[0].size();
vector< vector<int> > result(row);
for(int i=0;i <row ;i++)
result[i].resize(col,0);//设置数组的大小row行。col列
result[0][0]=grid[0][0];//初始化
for(int i=1;i<col;i++)//初始化第一行
result[0][i]=result[0][i-1]+grid[0][i];
for(int i=1;i<row;i++)//初始化第一列
result[i][0]=result[i-1][0]+grid[i][0];
for(int i=1;i<row;i++)//计算中间结果
for(int j=1;j<col;j++)
result[i][j]=min(result[i][j-1]+grid[i][j],result[i-1][j]+grid[i][j]);
return result[row-1][col-1];
}
};
注:本博文为EbowTang原创。兴许可能继续更新本文。
假设转载,请务必复制本条信息!
原文地址:http://blog.csdn.net/ebowtang/article/details/50485468
原作者博客:http://blog.csdn.net/ebowtang
本博客LeetCode题解索引:http://blog.csdn.net/ebowtang/article/details/50668895
<LeetCode OJ> 62. / 63. Unique Paths(I / II)的更多相关文章
- 【leetcode】62.63 Unique Paths
62. Unique Paths A robot is located at the top-left corner of a m x n grid (marked 'Start' in the di ...
- 62. 63. Unique Paths 64. Minimum Path Sum
1. A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below). ...
- LeetCode OJ:Unique Paths(唯一路径)
A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below). The ...
- leetcode@ [62/63] Unique Paths II
class Solution { public: int uniquePathsWithObstacles(vector<vector<int>>& obstacleG ...
- LeetCode Unique Paths (简单DP)
题意: 给出一个m*n的矩阵,robot要从[1][1]走到[m][n],每次只能往下/右走,问有多少种走法? 思路: DP的经典问题.先将[1][1]设为1,然后两种走法就是分别用[i][j]去更新 ...
- LeetCode OJ:Range Sum Query - Immutable(区域和)
Given nums = [-2, 0, 3, -5, 2, -1] sumRange(0, 2) -> 1 sumRange(2, 5) -> -1 sumRange(0, 5) -&g ...
- LeetCode OJ:Search for a Range(区间查找)
Given a sorted array of integers, find the starting and ending position of a given target value. You ...
- leetcode 62. Unique Paths 、63. Unique Paths II
62. Unique Paths class Solution { public: int uniquePaths(int m, int n) { || n <= ) ; vector<v ...
- 【LeetCode-面试算法经典-Java实现】【062-Unique Paths(唯一路径)】
[062-Unique Paths(唯一路径)] [LeetCode-面试算法经典-Java实现][全部题目文件夹索引] 原题 A robot is located at the top-left c ...
随机推荐
- 非阻塞键盘检测getchar()
#include <stdio.h> #include <conio.h> #include <Windows.h> int main() { char c; wh ...
- CISP/CISA 每日一题 17
CISSP 每日一题(答) What are often added to passwords to maketheir resultant hash secure and resistant to ...
- openstack之虚拟机创建流程分析
这篇博文静静的呆在草稿箱大半年了.假设不是由于某些原因被问到,以及由于忽略它而导致的损失,否则我也不知道什么时候会将它完毕.感谢这段时间经历的挫折,让我知道不足.希望你能给我更大的决心! 本文试图具体 ...
- 有趣的Ruby-学习笔记4
Ruby块 块.在我看来就是插入一段可变的函数 block_name{ statement1 statement2 .......... } 看起来不知道是什么,只是别急,继续往下看. 块函数通过yi ...
- 自己动手开发jQuery插件全面解析 jquery插件开发方法
jQuery插件的开发包括两种: 一种是类级别的插件开发,即给jQuery添加新的全局函数,相当于给jQuery类本身添加方法.jQuery的全局函数就是属于jQuery命名空间的函数,另一种是对象级 ...
- 1.11 Python基础知识 - 序列:元组
元组(tuple)是一组有序系列,元组和列表是否相似,但是元组是不可变的对象,不能修改.添加或删除元组中的元素,但可以访问元组中的元素 元组的定义: 元组采用圆括号中用逗号分隔的元素 元组的基本操作和 ...
- TC Hangs when using quick search extended on win10 (1703)
https://ghisler.ch/board/viewtopic.php?t=47682 I recently updated windows 10 to the latest released ...
- C# mongodb帮助类
这是在C#连接MongoDB的帮助类,所使用的驱动是在Vs2015的Nuget管理器中下载的mongodb驱动. 下载第一个,会自动下载下面的两个,不要删除. 在配置文件中配置连接字符串connStr ...
- jquery的滚动事件
$(selector).scroll(function);当滚动到合适的条件下,就触发某个函数. 现在基本就是前端利用AJAX对数据进行拼接操作,渲染进html的DOM结构中.
- ds1302模块的一个arduino程序
/* * 读写DS1302 时钟芯片 * @author Yangtf * 很棒的文档 http://www.21ic.com/jichuzhishi/datasheet/DS1302/data/18 ...