LeetCode 62. Unique Paths
2017-02-19 21:56
393 查看
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?
![](http://leetcode.com/wp-content/uploads/2014/12/robot_maze.png)
Above is a 3 x 7 grid. How many possible unique paths are there?
answer:
class Solution {
public:
int uniquePaths(int m, int n) {
vector<vector<int>> grid(m,vector<int> (n,1));
for(int i = 1; i < m; i ++){
for(int j = 1; j < n; j ++){
grid[i][j] = grid[i - 1][j] + grid[i][j - 1];
}
}
return grid[m - 1][n - 1];
}
};
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?
![](http://leetcode.com/wp-content/uploads/2014/12/robot_maze.png)
Above is a 3 x 7 grid. How many possible unique paths are there?
answer:
class Solution {
public:
int uniquePaths(int m, int n) {
vector<vector<int>> grid(m,vector<int> (n,1));
for(int i = 1; i < m; i ++){
for(int j = 1; j < n; j ++){
grid[i][j] = grid[i - 1][j] + grid[i][j - 1];
}
}
return grid[m - 1][n - 1];
}
};
相关文章推荐
- LeetCode 62. Unique Paths(唯一路线)
- Leetcode 62. Unique Paths
- leetcode 62. Unique Paths
- Leetcode 62. Unique Paths
- LeetCode||62. Unique Paths
- 【LeetCode】62. Unique Paths
- 第七周 leetcode 62. Unique Paths(Medium)
- LeetCode-62. Unique Paths
- 算法学习之动态规划(leetcode 62. Unique Paths)
- LeetCode --- 62. Unique Paths
- LeetCode *** 62. Unique Paths
- [Leetcode]@python 62. Unique Paths
- [LeetCode]62. Unique Paths
- leetcode 62. Unique Paths
- LeetCode 62. Unique Paths
- 【leetcode】62. Unique Paths
- LeetCode 62. Unique Paths
- <LeetCode OJ> 62. Unique Paths
- LeetCode 62. Unique Paths(java)
- LeetCode 62. Unique Paths