Unique Path
来源:互联网 发布:急难先锋8016优化 编辑:程序博客网 时间:2024/06/05 06:10
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.
11/1A very easy problem solved by DP
public class Solution { public int uniquePaths(int m, int n) { int[][] grid = new int[m][n]; // note that grid[i][0] = 1 and grid[0][j] = 1 for(int i=0; i<m; i++){ grid[i][0] = 1; } for(int j=0; j<n; j++){ grid[0][j] = 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]; }}
0 0
- Unique path
- Unique Path
- Unique Path
- Unique Path
- unique-path
- Unique Path II
- LeetCode 61. Unique Path
- [Leetcode]Unique Path
- [Leetcode]Unique Path II
- 10.3 Unique Path II
- Unique Path 2 - leetcode
- [leetcode] Unique Path II
- 【LeetCode】Unique Path Ⅱ
- Unique Path--LeetCode
- Unique Path II--LeetCode
- Unique path ii
- Unique Path II
- [Leetcode]Unique Path II
- 安装完Zend Server后,无法访问http://localhost:10081/ZendServer/的解决办法
- NSDate国际化
- 【Leetcode】Minimum Path Sum (DP)
- MapReduce获取分片数目
- C++语言的表达式模板:表达式模板的入门性介绍
- Unique Path
- gfhhfdx1
- Android 有关爬墙头儿的那点儿事儿 - 眼下出行难,不光车多、路还窄呀!
- Triangle
- hadoop中map和reduce的数量设置
- Objective-C (NSObject isKindOfClass、isMemberOfClass 、conformsToProtocol、isSubclassOfClass)
- USACO Electric Fences 解题报告
- First Missing Integer
- 交叉编译Cubietruck的u-boot