[DP]62. Unique Paths

题目描述：

A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).

The robot can only move either down or right at any point in time. The robot is trying to reach the bottom-right corner of the grid (marked 'Finish' in the diagram below).

How many possible unique paths are there?

递推公式也挺好写的：a[i][j] = a[i-1][j] +a[i][j-1]

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

但是这么提交之后，发现效率很低，在後17%左右，看了DISCUSS，发现大家递推公式都是一样的。那我有什么能改进的地方呢。我的空间比其他人大一些，这个可以试着减小，还有a[][1]和a[1][]这里可以直接赋值为1,不必加入循环。

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

这么改好之后再提交了一次，效率提升到beats 33%，还是比较低的。再仔细看了一下，其实可以在创建数组的时候，直接把所有元素初始化为1,这样就不需要额外的两次for循环来赋值。

class Solution:
    def uniquePaths(self, m, n):
        a = [([1] * n) for i in range(m)]
        for i in range(1,m):
            for j in range(1,n):
                a[i][j] = a[i-1][j]+a[i][j-1]
        
        return a[m-1][n-1]

但是提交了之后，效率依然是33%。