leetcode---62. Unique Paths
来源:互联网 发布:个人知识管理系统java 编辑:程序博客网 时间:2024/06/06 00:37
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.
public int uniquePaths(int m, int n) { int[][] dp = new int[m][n]; 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]; }
版本二:
public int uniquePaths(int m, int n) { if(m<1||n<1) return 0; int [] dp=new int[n]; dp[0]=1; for(int i = 0; i < m; i++){ for(int j = 1; j < n; j++){ dp[j]+=dp[j-1]; } } return dp[n-1]; }
0 0
- [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
- Leetcode 62. Unique Paths
- [leetcode] 62. Unique Paths
- 62. Unique Paths LeetCode
- [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
- Leetcode:62. Unique Paths
- Java常用类
- Leetcode #1 Two Sum (easy)
- java 异常处理
- 【Unity3D游戏开发】GameObject.Find()、Transform.Find查找隐藏对象 (十)
- JS中的DOM事件
- leetcode---62. Unique Paths
- 特权级保护
- 在Java中Arrays工具类实现功能的六种方法
- POJ2429 GCD & LCM Inverse (大整数分解)
- Java类的初始化顺序
- 算法日记(Java实现)第20160904(6)期——CCF俄罗斯方块
- 数组中a与&a的区别
- 网易有道2017内推编程题 队列操作(映射)
- 在ScrollView中加入listview后的处理