【Leetcode】Unique Paths (DP)
来源:互联网 发布:国家省市区四级联动js 编辑:程序博客网 时间:2024/06/18 11:14
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.
递推式
f(x,y)=f(x-1,y)+f(x,y-1)
代码如下
public int uniquePaths(int m, int n) {int[][] result = new int[m][n];for (int i = 0; i < m; i++)result[i][0] = 1;for (int i = 0; i < n; i++)result[0][i] = 1;for (int i = 1; i < m; i++) {for (int j = 1; j < n; j++) {result[i][j] = result[i - 1][j] + result[i][j - 1];}}return result[m - 1][n - 1];}
0 0
- 【Leetcode】Unique Paths (DP)
- [leetcode][DP] Unique Paths
- LeetCode Unique Paths(dp)
- leetcode---unique-paths---dp
- Leetcode-Unique Paths(dp)
- 【Leetcode】Unique Paths II (DP)
- [leetcode][DP] Unique Paths II
- LeetCode Unique Paths II(dp)
- leetcode 62. Unique Paths DP
- leetcode---Unique Paths II---dp
- leetcode 62. Unique Paths (dp)
- Leetcode-Unique Paths II(dp)
- LeetCode OJ-62. Unique Paths(DP)
- leetcode 62. Unique Paths DP动态规划
- LeetCode-62-Unique Paths DP水题
- LeetCode-63-Unique Paths II DP水题
- leetcode Unique Paths && Unique Paths
- 【DP】Unique Paths
- 四妹妹的一天
- VS链接错误:LNK1169
- full-nelson.c
- Django学习小记[4]——URL Dispatcher
- SDL2源代码分析2:窗口(SDL_Window)
- 【Leetcode】Unique Paths (DP)
- 大数据学习之MapReduce篇
- ganglia集成nagios集群监控
- 【Leetcode】Unique Paths II (DP)
- Videos on Athletics Kenya
- Vitamins for Teen Girls
- Videos on Yercaud Bypoll
- 北京秋日风景-最大的银杏林海景色
- 什么是线程安全和线程不安全