[LeetCode] Unique Paths
2015-06-02 23:40
218 查看
This is a fundamental DP problem. First of all, let's make some observations.
Since the robot can only move right and down, when it arrives at a point, there are only two possibilities:
It arrives at that point from above (moving down to that point);
It arrives at that point from left (moving right to that point).
Thus, we have the following state equations: suppose the number of paths to arrive at a point
The boundary conditions of the above equation occur at the leftmost column (
Now we can write down the following (unoptimized) code.
As can be seen, the above solution runs in
Further inspecting the above code, we find that keeping two columns is used to recover
Well, till now, I guess you may even want to optimize it to
Since the robot can only move right and down, when it arrives at a point, there are only two possibilities:
It arrives at that point from above (moving down to that point);
It arrives at that point from left (moving right to that point).
Thus, we have the following state equations: suppose the number of paths to arrive at a point
(i, j)is denoted as
P[i][j], it is easily concluded that
P[i][j] = P[i - 1][j] + P[i][j - 1].
The boundary conditions of the above equation occur at the leftmost column (
P[i][j - 1]does not exist) and the uppermost row (
P[i - 1][j]does not exist). These conditions can be handled by initialization (pre-processing) --- initialize
P[0][j] = 1, P[i][0] = 1for all valid
i, j. Note the initial value is
1instead of
0!
Now we can write down the following (unoptimized) code.
class Solution { int uniquePaths(int m, int n) { vector<vector<int> > path(m, vector<int> (n, 1)); for (int i = 1; i < m; i++) for (int j = 1; j < n; j++) path[i][j] = path[i - 1][j] + path[i][j - 1]; return path[m - 1][n - 1]; } };
As can be seen, the above solution runs in
O(n^2)time and costs
O(m*n)space. However, you may have observed that each time when we update
path[i][j], we only need
path[i - 1][j](at the same column) and
path[i][j - 1](at the left column). So it is enough to maintain two columns (the current column and the left column) instead of maintaining the full
m*nmatrix. Now the code can be optimized to have
O(min(m, n))space complexity.
class Solution { int uniquePaths(int m, int n) { if (m > n) return uniquePaths(n, m); vector<int> pre(m, 1); vector<int> cur(m, 1); for (int j = 1; j < n; j++) { for (int i = 1; i < m; i++) cur[i] = cur[i - 1] + pre[i]; swap(pre, cur); } return pre[m - 1]; } };
Further inspecting the above code, we find that keeping two columns is used to recover
pre[i], which is just
cur[i]before its update. So there is even no need to use two vectors and one is just enough. Now the space is further saved and the code also gets much shorter.
class Solution { int uniquePaths(int m, int n) { if (m > n) return uniquePaths(n, m); vector<int> cur(m, 1); for (int j = 1; j < n; j++) for (int i = 1; i < m; i++) cur[i] += cur[i - 1]; return cur[m - 1]; } };
Well, till now, I guess you may even want to optimize it to
O(1)space complexity since the above code seems to rely on only
cur[i]and
cur[i - 1]. You may think that 2 variables is enough? Well, it is not. Since the whole
curneeds to be updated for
n - 1times, it means that all of its values need to be saved for next update and so two variables is not enough.
相关文章推荐
- UIEvent 基本学习
- 指针式压力表自动读数:Auto Read the Value of Manometer
- UVa 1252 Twenty Questions
- 用MFC实现WebGUI--(CDHtmlDialog)
- 在js中获取query string 以及重写URL的函数
- [NetTopologySuite](1)线面相交
- CSS3新增属性选择器: [attribute*=value] 、[attribute^=value] 和[attribute$=value]
- DuiLib 最小框架
- Qt Gui程序显示文本用QPlainTextEdit
- iOS积累 002:UIImage的缩放与压缩
- UIView UIButton UIImageView 添加事件
- vector ,deque 和 list
- iOS开发系列--UITableView全面解析
- UILabel自适应高度和自动换行
- iOS_UITextField 基本操作
- Warning: The Copy Bundle Resources build phase contains this target's Info.plist file 'yintingting_baisi/Info.plist'.
- Android Volley完全解析(三),定制自己的Request
- iOS_UIButton 简单操作
- iOS按钮UIButton常用属性总结
- UIScrollView代理方法