LeetCode 62. Unique Paths

最新推荐文章于 2024-07-26 10:47:39 发布

wenyq7

最新推荐文章于 2024-07-26 10:47:39 发布

阅读量101

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/qq_37333947/article/details/108192040

版权

LeetCode 专栏收录该内容

287 篇文章 1 订阅

订阅专栏

题目：

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 7 x 3 grid. How many possible unique paths are there?

Example 1:

Input: m = 3, n = 2
Output: 3
Explanation:
From the top-left corner, there are a total of 3 ways to reach the bottom-right corner:
1. Right -> Right -> Down
2. Right -> Down -> Right
3. Down -> Right -> Right

Example 2:

Input: m = 7, n = 3
Output: 28

Constraints:

1 <= m, n <= 100
It's guaranteed that the answer will be less than or equal to 2 * 10 ^ 9.

这道题是一道很简单的dp题，看到题目就感觉是dp的大方向，然后分析题目，这个robot可以往右走或者往下走，那么每次走到一格的时候，它的上一步一定是上面一格或者左边一格，既然它有这两种走到它的方式，那就是走到它上一格的两种方式的路线数量之和，所以就是dp[i][j] = dp[i - 1][j] + dp[i][j - 1]。初始化dp数组需要把第一行和第一列都赋值为1，因为只有一种方案。

时间复杂度O(mn)，空间复杂度O(mn)。

Runtime: 0 ms, faster than 100.00% of Java online submissions for Unique Paths.

Memory Usage: 36.1 MB, less than 80.50% of Java online submissions for Unique Paths.

class Solution {
    public int uniquePaths(int m, int n) {
        int[][] dp = new int[m][n];
        for (int i = 0; i < n; i++) {
            dp[0][i] = 1;
        }
        for (int i = 0; i < m; i++) {
            dp[i][0] = 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];
    }
}