leetcode 062 Unique Paths

最新推荐文章于 2019-06-04 13:30:41 发布

walter1990

最新推荐文章于 2019-06-04 13:30:41 发布

阅读量647

点赞数

分类专栏： Leetcode

本文链接：https://blog.csdn.net/suichen1/article/details/51290934

版权

Leetcode 专栏收录该内容

127 篇文章 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 {
// public:
// 	int uniquePaths(int m, int n) {
// 		vector<vector<int> > matrix(100, vector<int>(100, 1));
		
// 		//matrix[i][j] = matrix[i][j-1]+matrix[i-1][j]
// 		for(int i = 1; i < n; i++) {
// 			for(int j = 1; j < m; j++) {
// 					matrix[i][j] = matrix[i][j-1]+matrix[i-1][j];
// 			}
// 		}

// 		return matrix[n-1][m-1];
// 	}
// }

class Solution {
public:
	int uniquePaths(int m, int n) {
		if(m > n) return uniquePaths(n, m);
		vector<int> cur(m,1);
		
		//matrix[i][j] = matrix[i][j-1]+matrix[i-1][j]

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

		return cur[m-1];
	}
}