不同的路径（Python）

class Solution:
    """
    @param m: positive integer (1 <= m <= 100)
    @param n: positive integer (1 <= n <= 100)
    @return: An integer
    """
    def uniquePaths(self, m, n):
        # write your code here
        # 当mn为0,则为0
        if m*n == 0:
            return 0
        # 当m、n其中一个为1则不能进行上下或者左右的行为，情况为1
        # 递归思想
        L = [[0]*n for i in range(m)]
        print(L)
        print(L[m-1][n-1])

        for i in range(1,m):
            L[i][0] = 1
        for j in range(1,n):
            L[0][j] = 1 
        for i in range(1,m):
            for j in range(1,n):
                L[i][j]= L[i-1][j] + L[i][j-1]
        print(L[m-1][n-1])
        return L[m-1][n-1]