【Leetcode】Unique Paths
来源:互联网 发布:手机 比价软件 编辑:程序博客网 时间:2024/06/16 22:00
题目链接:https://leetcode.com/problems/unique-paths/
题目:
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.
思路:
c[i][j]表示从map[0][0] 不同的路径数,状态转移方程:c[i][j] = c[i-1][j]+c[i][j-1]
算法:
public int uniquePaths(int m, int n) { int c[][] = new int[m][n]; c[0][0] = 1; for (int i = 1; i < m; i++) { c[i][0] = 1; } for (int j = 1; j < n; j++) { c[0][j] = 1; } for (int i = 1; i < m; i++) { for (int j = 1; j < n; j++) { c[i][j] = c[i - 1][j] + c[i][j - 1]; } } return c[m - 1][n - 1]; }
1 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
- 【Leetcode】Unique Paths II
- vertica-Rebalance用法
- 危险系数---深搜
- JavaScript学习--Item11 arguments对象
- 第13周-项目1-分数类中的运算符重载(3)
- 【Leetcode】Unique Paths
- hibernate_Restrictions用法
- zy-题目总结
- dfs实现最小路
- 【Leetcode】Triangle
- apache 设置用户注意事项
- js 阻止冒泡排序
- GitHub前100的安卓开源架包
- ajax 传json到后台servlet接收