动态规划解决迷宫路径问题

问题描述：Unique paths

动态规划解决

class Solution:
    def uniquePaths(self, m: int, n: int) -> int: 
        #开辟一个二维数组
        lis = [[0]*n]*m
        for i in range(0,m):
            for j in range(0,n):
                if i == 0 and j == 0:
                    lis[i][j] =1
                if i >0 and j > 0:
                    lis[i][j] = lis[i-1][j] + lis[i][j-1]
                if i >0 and j ==0:
                    lis[i][j] = lis[i-1][j]
                if i ==0 and j >0:
                    lis[i][j] = lis[i][j-1]
        return lis[m-1][n-1]