【LeetCode】62.不同路径

#!/usr/bin/python3
# -*- coding: utf-8 -*-
# @Time: 2019/3/15
# @Author: xfLi
# The file...

"""
问题分析：
动态规划方法，dp方程式如下：
dp[n][m] = dp[n-1][m] + dp[n][m-1]  # n为行数，m为列数
"""
def uniquePaths(m, n):
    dp = [[0] * m for _ in range(n)]  # n*m大小
    dp[0][0] = 1
    for i in range(n):
        for j in range(m):
            if i + 1 < n:
                dp[i + 1][j] += dp[i][j]
            if j + 1 < m:
                dp[i][j + 1] += dp[i][j]
    return dp[n-1][m-1]

if __name__ == '__main__':
    m = 7
    n = 3
    result = uniquePaths(m, n)
    print(result)