题解 | #走方格的方案数#

class Solution: # 动态规划
    def uniquePaths(self, m: int, n: int) -> int:
        dp = [[1 for i in range(n)] for j in range(m)]
        for i in range(1, m):
            for j in range(1, n):
                dp[i][j] = dp[i][j - 1] + dp[i - 1][j]
        return dp[m - 1][n - 1]
    

while True:
    try:
        a = str(input())
        list_a = a.split()
        n,m = int(list_a[0])+1, int(list_a[1])+1
        result = Solution()
        result  = result.uniquePaths(n, m)
        print(result)
    except:
        break

理解一下动态规划思路