#62 Unique Paths——Top 100 Liked Questions

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?

Above is a 7 x 3 grid. How many possible unique paths are there?

Note: m and n will be at most 100.

Example 1:

class Solution(object):
    def uniquePaths(self, m, n):
        """
        :type m: int
        :type n: int
        :rtype: int
        """
        res = [[0 for j in range(m)]for i in range(n)]
        for i in range(n):
            for j in range(m):
                if i == 0 or j == 0:
                    res[i][j] = 1
                else:
                    res[i][j] = res[i - 1][j] + res[i][j - 1]
        print(res)
        return res[n - 1][m - 1]

Input: m = 3, n = 2
Output: 3
Explanation:
From the top-left corner, there are a total of 3 ways to reach the bottom-right corner:
1. Right -> Right -> Down
2. Right -> Down -> Right
3. Down -> Right -> Right

Example 2:

Input: m = 7, n = 3
Output: 28

"""

第一次：动态规划，每个位置只能从左边过来或者上边过来：path(x, y)= path(x-1,y)+path(x,y-1)。当这个位置是最上面时只能从左边过来，当这个位置是最左边时，只能从上面过来
"""

class Solution(object):
    def uniquePaths(self, m, n):
        """
        :type m: int
        :type n: int
        :rtype: int
        """
        res = [[0 for j in range(m)]for i in range(n)]
        for i in range(n):
            for j in range(m):
                if i == 0 or j == 0:
                    res[i][j] = 1
                else:
                    res[i][j] = res[i - 1][j] + res[i][j - 1]
        print(res)
        return res[n - 1][m - 1]

"""

Runtime: 28 ms, faster than 22.76% of Python online submissions for Unique Paths.

Memory Usage: 11.7 MB, less than 65.46% of Python online submissions for Unique Paths.

"""