DAY24：leetcode #62 Unique Paths

最新推荐文章于 2024-07-19 06:39:47 发布

路人甲wttttt

最新推荐文章于 2024-07-19 06:39:47 发布

阅读量215

点赞数

分类专栏：算法文章标签： leetcode python

本文链接：https://blog.csdn.net/zcy19941015/article/details/53114734

版权

算法专栏收录该内容

76 篇文章 0 订阅

订阅专栏

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 3 x 7 grid. How many possible unique paths are there?

Note: m and n will be at most 100.

Subscribe to see which companies asked this question

class Solution(object):
    def findPath(self, m, n):
        if (m,n) in self.cache:
            return self.cache[(m,n)]
        m_step, n_step =0,0
        if m > 0:
            m_step = self.findPath(m - 1, n)
        if n > 0:
            n_step = self.findPath(m, n - 1)
        self.cache[(m,n)] = m_step + n_step
        return self.cache[(m,n)]
    def uniquePaths(self, m, n):
        """
        :type m: int
        :type n: int
        :rtype: int
        """
        self.cache = {(0, 0): 1}
        return self.findPath(m - 1, n - 1)

主要思路是加缓存的DFS