[leetcode] Unique Paths
来源:互联网 发布:淘宝严重违规12分2999 编辑:程序博客网 时间:2024/05/01 02:28
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.
思路:动态规划
代码:
class Solution {public: int uniquePaths(int m, int n) { int f[m][n]; for(int i=0;i<m;i++) f[i][0]=1; for(int i=0;i<n;i++) f[0][i]=1; for(int i=1;i<m;i++){ for(int j=1;j<n;j++){ f[i][j]=f[i-1][j]+f[i][j-1]; } } return f[m-1][n-1]; }};
0 0
- leetcode Unique Paths && Unique Paths
- Leetcode-Unique Paths&Unique PathsII
- [LeetCode] Unique Paths and Unique Paths II
- leetcode--Unique Paths && Unique Paths ii
- leetcode--Unique Paths && Unique Paths ii
- 【Leetcode】【python】Unique Paths/Unique Paths II
- LeetCode: Unique Paths
- LeetCode: Unique Paths II
- [Leetcode] Unique Paths
- [Leetcode] Unique Paths II
- LeetCode : Unique Paths
- LeetCode : Unique Paths II
- leetcode 9: Unique Paths
- [LeetCode] Unique Paths
- [LeetCode] Unique Paths II
- [LeetCode]Unique Paths
- [LeetCode]Unique Paths II
- [LeetCode] Unique Paths
- HDFS:NameNode、DataNode、SecondaryNameNode
- Linux Thread 最基本用法
- LeetCode-Sum Root to Leaf Numbers
- 再谈冒烟测试
- [题解][LeetCode][Valid Parentheses]
- [leetcode] Unique Paths
- LeetCode: Validate Binary Search Tree
- 解密 【JavaScript Eval】不为人知的秘密
- IOS开发之__bridge,__bridge_transfer和__bridge_retained
- 初学ICE中间件总结笔记(一)
- 总结安卓开发中常用的七个第三方框架
- day122(7.13)性能测试知识总结V
- Enterprise Architect使用问题记录
- JavaScript基础-window.location的用法