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
class Solution {
public:
int uniquePaths(int m, int n) {
vector<vector<int>> path(m + 1, vector<int>(n + 1,0));
for(int i = 1; i <= m; i++){
path[i][1] = 1;
}
for(int j = 1; j <= n; j++){
path[1][j] = 1;
}
for(int i = 2; i <= m; i++){
for(int j = 2; j <= n; j++){
path[i][j] = path[i-1][j] + path[i][j-1];
}
}
return path[m][n];
}
};

LeetCode 62 — Unique Paths（C++ Java Python）

2014-02-23 22:00:50

leetCode 62.Unique Paths （唯一路径） 解题思路和方法

2015-07-15 14:23:47

62 Unique Paths

2015-10-14 21:49:20

leetcode 62. Unique Paths-唯一路径|动态规划

2016-03-11 15:16:22

【LeetCode with Python】 Unique Paths

2014-08-29 18:11:24

Unique Paths -- LeetCode

2014-03-26 04:13:48

LeetCode-62-Unique Paths(动态规划)-Medium

2016-03-14 08:51:58

Unique Paths II -- LeetCode

2014-03-26 04:15:28

62-Unique Paths

2017-06-23 15:36:01

LeetCode 62. Unique Paths （Python）

2017-08-08 20:19:50