114. 不同的路径（dp动态规划）

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
        #动态规划dp
        #初始条件
        res = []
        for x in range(m):
            res.append([0]*n)
        
        for i in range(m):
            for j in range(n):
                ##初始边界，初始条件res[0][0]也放在了这里
                if i == 0 or j == 0:
                    res[i][j] = 1 
                    continue
                res[i][j] = res[i-1][j] + res[i][j-1]
        
        return res[m-1][n-1]