LeetCode 62 Unique Paths (递推)

最新推荐文章于 2022-11-29 17:58:58 发布

_TCgogogo_

最新推荐文章于 2022-11-29 17:58:58 发布

阅读量524

点赞数

分类专栏： Leetcode Medium LeetCode 文章标签： leetcode 递推

本文链接：https://blog.csdn.net/Tc_To_Top/article/details/52413551

版权

LeetCode 同时被 2 个专栏收录

334 篇文章 5 订阅

订阅专栏

Leetcode Medium

244 篇文章 0 订阅

订阅专栏

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?

题目链接：https://leetcode.com/problems/unique-paths/

题目分析：当前点可以从上边或者左边走来

public class Solution {
    public int uniquePaths(int m, int n) {
        int[][] dp = new int[m][n];
        for (int i = 0; i < m; i ++) {
            for (int j = 0; j < n; j ++) {
                dp[i][j] = 0;
            }
        }
        dp[0][0] = 1;
        for (int i = 0; i < m; i ++) {
            for (int j = 0; j < n; j ++) {
                if (i - 1 >= 0) {
                    dp[i][j] += dp[i - 1][j];
                }
                if (j - 1 >= 0) {
                    dp[i][j] += dp[i][j - 1];
                }
            }
        }
        return dp[m - 1][n - 1];
    }
}