LeetCode热题100——62. 不同路径

方法

自解

动态规划
num[i][j] = sum(num[i-1,1:j]) + sum(num[1:i, j-1])

import numpy
class Solution(object):
    def uniquePaths(self, m, n):
        """
        :type m: int
        :type n: int
        :rtype: int
        """
        num = numpy.zeros((m + 1, n + 1))
        for i in range(m+1):
            num[i][1] = 1
        for i in range(n+1):
            num[1][i] = 1
        for i in range(2, m + 1):
            for j in range(2, n + 1):
                num[i][j] = sum(num[i-1,1:j]) + sum(num[1:i, j-1])
        return int(num[m,n])

其他解法

1.动态规划
当前位置只有两个方向可以达到：
f[i][j] = f[i - 1][j] + f[i][j - 1]

class Solution:
    def uniquePaths(self, m: int, n: int) -> int:
        f = [[1] * n] + [[1] + [0] * (n - 1) for _ in range(m - 1)]
        print(f)
        for i in range(1, m):
            for j in range(1, n):
                f[i][j] = f[i - 1][j] + f[i][j - 1]
        return f[m - 1][n - 1]

2.排列组合

class Solution:
    def uniquePaths(self, m: int, n: int) -> int:
        return comb(m + n - 2, n - 1)