LeetCode OJ 系列之62 Unique Paths --Python

Problem:

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.

Answer:

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