leetcode 62:Unique Paths

原创 2015年11月19日 20:32:10

题目:

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.

思路:

这题,数学上的解法就是C{m+n-2}{n-1}。

我们用学过的算法来解。动态规划无疑是非常简单的一种解法。

用DP[i][j]表示从开始到第i+1行j+1列共有的路径条数。

显然这题满足下列最优子结构:

DP[i][j]=DP[i-1][j]+DP[i][j-1]            i,j>0;

DP[i][j]=1                                          i=1或j=1

最后DP[m-1][n-1]即为到finish处的路径条数。

时间复杂度:O(m*n)

实现如下:

class Solution {
public:
	int uniquePaths(int m, int n) {
		vector<vector<int>> DP(m, vector<int>(n, 1));
		for (int i = 1; i < m; i++)
			for (int j = 1; j < n; j++)
			{
				DP[i][j] = DP[i][j - 1] + DP[i - 1][j];
			}
		return DP[m - 1][n - 1];
	}
};

最后补上数学解法:

class Solution {
public:
    int uniquePaths(int m, int n) {
        if(m <=0 || n <= 0) return 0;
        long long res = 1;
        for(int i = n; i < m+n-1 ; i++){
            res = res * i / (i- n + 1);
        }
        return (int)res;
    }
};


版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

leetcode - 62,63. Unique Paths(II) & 64.Minimum Path Sum

算法系列博客之Dynamic Programming 本篇博客将运用动态规划的思想来解决leetcode上264号问题这三个题目的共同之处在于均是二维矩阵上的规划问题问题描述:62 Unique Pa...
  • Quiteen
  • Quiteen
  • 2017年06月11日 20:40
  • 96

Leetcode62 Unique Paths

Unique Paths A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diag...

[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)...

[LeetCode]62.Unique Paths

【题目】 A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram belo...

leetcode解题之62&63. Unique Paths ||64. Minimum Path Sum java版(路径(最短)可达)

leetcode解题之62&63. Unique Paths || java版(路径可达) ,63. Unique Paths II ,62. Unique Paths 。64. Minimum Pa...

LeetCode --- 62. Unique Paths

题目链接:Unique Paths A robot is located at the top-left corner of a m x n grid (marked 'Start' in the ...
  • makuiyu
  • makuiyu
  • 2015年03月15日 23:32
  • 487

算法设计Week12 LeetCode Algorithms Problem #62 Unique Paths

题目描述: A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram bel...

[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). Th...

[Leetcode刷题总结系列][Dynamic Programming]62. Unique Paths

Leetcode Dynamic Programming 62. Unique Paths A robot is located at the top-left corner of a m*n gr...

LeetCode 64/62/63. Minimum Path Sum/ Unique Paths i, ii

1. 题目描述1.1 62 A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the dia...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:leetcode 62:Unique Paths
举报原因:
原因补充:

(最多只允许输入30个字)