LeetCode刷题【Array】 Unique Paths

最新推荐文章于 2024-01-11 21:40:32 发布

SimonCode

最新推荐文章于 2024-01-11 21:40:32 发布

阅读量239

点赞数

分类专栏： LeetCode 文章标签： Array leetcode

本文链接：https://blog.csdn.net/ltxiaoxia/article/details/64922120

版权

LeetCode 专栏收录该内容

49 篇文章 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).

Note: m and n will be at most 100.

解决方法：Runtime: 1 ms DP 思想

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

解决方法二：该问题可以转化为一个排列组合问题，从左上到右下，一共需要m+n-2 步，从中选择m-1个right步即为path数 Runtime: 1 ms

public class Solution {
    public int uniquePaths(int m, int n) {
    double value = 1;
    for (int i = 1; i <= n - 1; i++) {
        value *= ((double) (m + i - 1) / (double) i);
    }
    return (int) Math.round(value);
}
}

参考：

【1】https://leetcode.com/