【leetcode】Array——Unique Paths(62)
来源:互联网 发布:js 自定义属性 data 编辑:程序博客网 时间:2024/06/06 06:53
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?
解题:
原始思路:使用数学计算的方法,排列组合算。
得使用BigInteger 写代码过程中犯了错误,int->String a+”0” 应该是a+””即可
改进思路:动态规划
方法一:二维数组
public int uniquePaths(int m,intn ){
int[][]a =new int[m][n];
for (int i = 0;i <m;i++) {
a[i][0] = 1;
}
for (int i = 0;i <n;i++) {
a[0][i] = 1;
}
for (int i = 1;i <m;i++) {
for (int j = 1;j <n;j++) {
a[i][j] =a[i-1][j] +a[i][j-1];
}
}
return a[m-1][n-1];
}
方法二:一维数组
public int uniquePaths(int m,int n) {
// DP with 1 dimension array
int[]a =new int[n];
for (int j = 0;j <n;j++) {
a[j] = 1;
}
for (int i = 1;i <m;i++) {
for (int j = 1;j <n;j++) {
a[j] +=a[j-1];
}
}
return a[n-1];
}
- 【leetcode】Array——Unique Paths(62)
- 【leetcode】Array——Unique Paths II(63)
- LeetCode—Unique Paths
- LeetCode刷题【Array】 Unique Paths
- leetcode.array--62. Unique Paths
- LeetCode 62 — Unique Paths(C++ Java Python)
- LeetCode(62)Unique Paths
- Leetcode(62)Unique Paths
- LeetCode——Unique Paths
- LeetCode——Unique Paths
- Leetcode——Unique Paths
- leetcode——Unique Paths & Unique PathsⅡ
- [leetcode 62] Unique Paths
- LeetCode(62): Unique Paths
- [LeetCode 62]Unique Paths
- leetcode || 62、Unique Paths
- Unique Paths - LeetCode 62
- leetcode-62 Unique Paths
- 【leetcode】Array——word search(79)
- 关于编程语言中的显式\隐式初始化
- leetcode191题 题解 翻译 C语言版 Python版
- 面试笔试杂项积累-leetcode 211-215
- 26. Remove Duplicates from Sorted Array LeetCode
- 【leetcode】Array——Unique Paths(62)
- django学习之 pdf报表(表格)生成
- Java—设计模式(工厂模式)
- java常见问题
- 66. Plus One LeetCode
- 继承与多态的学习
- 华为机试题:可怕的阶乘
- 【leetcode】Array——Unique Paths II(63)
- 【leetcode】Array——Triangle(120)