LeetCode——Unique Paths

最新推荐文章于 2021-12-27 16:03:07 发布

yjfanling

最新推荐文章于 2021-12-27 16:03:07 发布

阅读量131

点赞数

分类专栏：算法文章标签： java leetcode

本文链接：https://blog.csdn.net/sinat_22994595/article/details/88548233

版权

算法专栏收录该内容

83 篇文章 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 7 x 3 grid. How many possible unique paths are there?
Note: m and n will be at most 100.

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:

Right -> Right -> Down
Right -> Down -> Right
Down -> Right -> Right

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

解法

用动态规划解题，令dp[i][j]表示走到当前位置有几种走法，则dp[i][j]=dp[i-1][j]+dp[i][j-1],其中第一行和第一列的值都为1

public int uniquePaths(int m, int n) {
        int[][] dp=new int[n][m];
        Arrays.fill(dp[0], 1);
        for(int i=0;i<n;i++)
        	dp[i][0]=1;
        for(int i=1;i<n;i++)
        	for(int j=1;j<m;j++)
        		dp[i][j]=dp[i-1][j]+dp[i][j-1];
        return dp[n-1][m-1];
	}

Runtime: 0 ms, faster than 100.00% of Java online submissions for Unique Paths.
Memory Usage: 34.4 MB, less than 79.13% of Java online submissions for Unique Paths.