leetcode - Unique Paths
2014-10-15 13:42
323 查看
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?
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?
class Solution { public: int uniquePaths(int m, int n) { std::vector<std::vector<int>> dp(m,std::vector<int>(n,0)); for (int i = 0; i < m; i++) { dp[i][0] = 1; } for (int i = 0; i < n; 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]; } };
相关文章推荐
- LeetCode--Unique Paths
- [LeetCode]Unique Paths
- LeetCode 62. Unique Paths
- LeetCode-62&63.Unique Paths
- 算法分析与设计——LeetCode:62. Unique Paths
- LeetCode解题笔记62 Unique Paths
- Leetcode[62]-Unique Paths
- leetcode: Unique Paths
- Leetcode_Unique Paths
- Leetcode——Unique Paths
- leetcode解题方案--062--Unique Paths
- Leetcode62-63 Unique Paths
- [Leetcode] Unique Paths
- [leetcode]_Unique Paths
- LeetCode - Unique Paths - Frequent
- [LeetCode] Unique Paths
- [Leetcode]Unique Paths
- LeetCode-62-Unique Paths(C语言实现)
- LeetCode--Unique Paths
- 【LeetCode练习题】Unique Paths