leetcode62不同路径

import numpy as np

class Solution:

    def uniquePaths(self, m: int, n: int) -> int:

        res=np.ones((m,n),dtype='int32')

        for i in range(1,m):

            for j in range(1,n):

                res[i][j]=res[i-1][j]+res[i][j-1]

        return res[-1][-1]

你可能感兴趣的:(leetcode62不同路径)