9.9 练手腾讯50题 62

最新推荐文章于 2024-08-23 20:18:55 发布

vancooler

最新推荐文章于 2024-08-23 20:18:55 发布

阅读量85

点赞数

分类专栏：算法练手

本文链接：https://blog.csdn.net/vancooler/article/details/100652499

版权

算法练手专栏收录该内容

49 篇文章 0 订阅

订阅专栏

Leetcode 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?

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:
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

一开始使用递归深搜来做，超时了

改变策略用动态规划来做，想法是先用一个矩阵储存到达每个块的路径总量，所以下一个块就是上面和左边块的路径之和，避免了重复计算，准则是：

mat[i][j] = mat[i-1][j] + mat[i][j-1] i,j !=0

else if i =0 j = 0 : mat[i][j] = 0

else: i = 0 or j = 0: mat[i][j] = 1

代码如下：

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

beat 95+% 时间复杂度为O(m*n)

另附递归代码：

class Solution(object):
    def uniquePaths(self, m, n):
        """
        :type m: int
        :type n: int
        :rtype: int
        """
        if(m == 1):
            return 1
        if(n == 1):
            return 1
        else:
            downPath = self.uniquePaths(m-1, n)
            rightPath = self.uniquePaths(m, n-1)
            return downPath+rightPath