44ms Python DP solution

  • 4
    def uniquePaths(self, m, n):
            table = [[0 for x in range(n)] for x in range(m)]
            for i in range(m):
                table[i][0] = 1
            for i in range(n):
                table[0][i] = 1
            for i in range(1,m):
                for j in range(1,n):
                    table[i][j] = table[i-1][j] + table[i][j-1]
            return table[m-1][n-1]

Log in to reply

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.