62. Unique Paths
2017-09-26 04:47
232 查看
class Solution { public int uniquePaths(int m, int n) { int[][] dp=new int[m] ; dp[0][0]=1; for(int i=0;i<m;i++) for(int j=0;j<n;j++) dp[i][j]+=(i>0?dp[i-1][j]:0)+(j>0?dp[i][j-1]:0); return dp[m-1][n-1]; } }
相关文章推荐
- 62. Unique Paths
- 62. Unique Paths
- 62. Unique Paths
- 62. Unique Paths
- 62. Unique Paths
- LeetCode 62/63/120/64 Unique PathsI/II Triangle/Min sum Path/Rectangle Area--DP
- 62. Unique Paths
- 62. Unique Paths
- 62. Unique Paths
- LeetCode - 62/63/64 - Unique Paths/Minimum Path Sum
- [LeetCode-Algorithms-62] "Unique Paths" (2017.11.21-WEEK12)
- 62. Unique Paths
- 62. Unique Paths
- 62. Unique Paths
- 62. Unique Paths
- 62. Unique Paths \ 63. Unique Paths II
- LeetCode 62 Unique Paths II
- 62. Unique Paths
- 62. Unique Paths
- 62. Unique Paths