LeetCode 062 Unique Paths
来源:互联网 发布:残疾人产品设计 知乎 编辑:程序博客网 时间:2024/05/01 22:19
题目描述
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.
分析
构造二维数组dp[m][n],其中
其中dp[m-1][n-1]就是结果。
代码
public static int uniquePaths(int m, int n) { if (m <= 0 || n <= 0) { return 0; } int[][] dp = new int[m][n]; for (int y = 0; y < n; y++) { dp[0][y] = 1; } for (int x = 0; x < m; x++) { dp[x][0] = 1; } for (int y = 1; y < n; y++) { for (int x = 1; x < m; x++) { dp[x][y] = dp[x - 1][y] + dp[x][y - 1]; } } return dp[m - 1][n - 1]; }
1 0
- LeetCode 062 Unique Paths
- LeetCode 062 Unique Paths
- LeetCode 062 Unique Paths
- leetcode 062 Unique Paths
- LeetCode 062 Unique Paths
- LeetCode: Unique Paths II [062]
- leetcode Unique Paths && Unique Paths
- Leetcode-Unique Paths&Unique PathsII
- leetcode 062 —— Unique Paths
- leetcode解题方案--062--Unique Paths
- [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
- PowerShell GUI之创建Button和输入框
- LeetCode 子 Climbing Stairs
- linux 时间同步
- 第12周—项目3(2)图的广度遍历
- poj-2140-Herd Sums- 数学规律-连续和为N的方案数
- LeetCode 062 Unique Paths
- Android .gitignore文件示例
- XCode中类似reveal功能
- 使用Chrome调试JavaScript的断点设置和调试技巧
- Delete Node in a Linked List (Leet Code)
- 函数outer()
- VS和Liux环境下分别编译boost标准库
- 二叉树的先序,中序,后序遍历
- svn中的revert和update