LeetCode題目鏈接
有一個(gè)機(jī)器人的位于一個(gè) m × n 個(gè)網(wǎng)格左上角。
機(jī)器人每一時(shí)刻只能向下或者向右移動(dòng)一步。機(jī)器人試圖達(dá)到網(wǎng)格的右下角。
問(wèn)有多少條不同的路徑？

 def uniquePaths(self, m, n):
        # write your code here
        if m <= 0 or n <= 0:
            return 0
        #python創(chuàng)建二維數(shù)組，前列后行
        f = [[0 for col in range(n)] for row in range(m)]
       
        for i in range(m):
            for j in range(n):
                if i == 0 or j == 0:
                    f[i][j] = 1
                else:
                    f[i][j] = f[i-1][j] + f[i][j-1]
        return f[m-1][n-1]