leetcode || 62、Unique Paths

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.

Hide Tags

Array Dynamic
Programming

题意:给定一个 mxn的矩阵,求从(0,0)到(m-1,n-1)的路径数,每次只能往x 、y增长的方向移动

thinking:

(1)这道题相当经典,为什么这样说,且听分析

看到题第一反应想到用DFS遍历每一条路径,计个数即可。但是DFS的时间复杂度是路径数total 的线性表达式,提交显示 TLE

(2)抖机灵想到用递归,f(m,n)=f(m-1,n)+f(m,n-1),当m或n为1时,路径数为1。 但是,递归法的时间复杂度同DFS法一样,提交也是TLE

(3)正确的解法是DP,状态转移方程 同递归法一样:a[m][n] = a[m-1][n]+a[m][n-1],采用自底向上的思路,时间复杂度和空间复杂度都为O(m*n)

code:

DFS法: TLE

class Solution {
public:
    int uniquePaths(int m, int n) {
        int count=0;
        int x=0,y=0;
        dfs(x,y,m,n,count);
        return count;

    }
protected:
    void dfs(int x, int y, int m, int n, int &count)
    {

        if(x==m-1 && y==n-1)
        {
            count++;
            return;
        }
       if(x<m-1 && y< n-1)
       {
           dfs(x+1,y,m,n,count);
           dfs(x,y+1,m,n,count);
       }
       else if(x==m-1 && y<n-1)
           dfs(x,y+1,m,n,count);
       else
           dfs(x+1,y,m,n,count);
    }
};

递归法:TLE

class Solution {
public:
    int uniquePaths(int m, int n) {
       return f(m,n);

    }
protected:
    int f(int m,int n)
    {
        if(m==1 || n==1)
            return 1;
        else
            return f(m-1,n)+f(m,n-1);
    }
};

DP法:accepted

class Solution {
public:
    int uniquePaths(int m, int n) {
        vector<vector<int> > a(m, vector<int>(n));

        for(int i = 0; i < n; i++)
            a[0][i] = 1;

        for(int i = 0; i < m; i++)
            a[i][0] = 1;

        for(int i = 1; i < m; i++)
            for(int j = 1; j < n; j++)
                a[i][j] = a[i-1][j] + a[i][j-1];

        return a[m-1][n-1];
    }
};
时间: 2024-11-06 07:06:18

leetcode || 62、Unique Paths的相关文章

LeetCode 62, 63 Unique Paths I+II

62. Unique Paths 空间可以按行优化为 O(n),也可以按列优化为O(m). class Solution { public: int uniquePaths(int m, int n) { int dp[m][n]={0}; dp[0][0]=1; for (int i=0;i<m;++i){ for (int j=0;j<n;++j){ if (i==0&&j==0) continue; dp[i][j]=0; if (j-1>=0) dp[i][j]

leetcode || 63、Unique Paths II

problem: Follow up for "Unique Paths": Now consider if some obstacles are added to the grids. How many unique paths would there be? An obstacle and empty space is marked as 1 and 0 respectively in the grid. For example, There is one obstacle in

LeetCode 62 _ Unique Paths 全部不同路径

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

&amp;lt;LeetCode OJ&amp;gt; 62. / 63. Unique Paths(I / II)

62. Unique Paths My Submissions Question Total Accepted: 75227 Total Submissions: 214539 Difficulty: Medium 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

【一天一道LeetCode】#63. Unique Paths II

一天一道LeetCode (一)题目 Follow up for "Unique Paths": Now consider if some obstacles are added to the grids. How many unique paths would there be? An obstacle and empty space is marked as 1 and 0 respectively in the grid. For example, There is one ob

leetcode笔记:Unique Paths

一. 题目描述 A robot is located at the top-left corner of a m 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

&lt;LeetCode OJ&gt; 63. Unique Paths II

63. Unique Paths II My Submissions Question Total Accepted: 55136 Total Submissions: 191949 Difficulty: Medium Follow up for "Unique Paths":紧接着上一题"唯一路劲",现在考虑有一些障碍在网格中,无法到达,请重新计算到达目的地的路线数目 Now consider if some obstacles are added to the

LeetCode 63 _ Unique Paths II 全部不同路径2

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

62. 63. Unique Paths 64. Minimum Path Sum

1. 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' i