Unique Paths

最新推荐文章于 2024-09-24 08:39:28 发布

ayst123

最新推荐文章于 2024-09-24 08:39:28 发布

阅读量377

点赞数

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

本文链接：https://blog.csdn.net/ayst123/article/details/40775429

版权

leetcode 专栏收录该内容

216 篇文章 0 订阅

订阅专栏

easy one;

A robot is located at the top-left corner of a m x ngrid (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?

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

python

class Solution:
    # @return an integer
    def uniquePaths(self, m, n):
        if m==0 or n==0:
            return 0
            
        all = [[0]*n for i in range(m)]
        for i in range(n):
            all[0][i] = 1
        for i in range(1,m):
            all[i][0] = 1
        
        for i in range(1,m):
            for j in range(1,n):
                all[i][j] = all[i-1][j] + all[i][j-1]
        
        return all[m-1][n-1]