【LeetCode】62. Unique Paths

最新推荐文章于 2024-07-26 10:47:39 发布

hope1262946533

最新推荐文章于 2024-07-26 10:47:39 发布

阅读量90

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/liuke19950717/article/details/89891415

版权

LeetCode 专栏收录该内容

92 篇文章 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 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

描述：

给出一个n*m的棋盘，起点是左上角，终点是右下角，每一次只能向下或者向右走一格，问到达终点不同的解法有多少种

分析：

把问题模型化，那么必定要走的步数是（m - 1）+ （n - 1），共 m + n - 2 次

因为只有两种移动形态，因此只要横着走的时刻确定下来，那么整个移动路径也确定了下来，

于是，求组合数C （m + n - 2， n - 1），即为结果

（求组合数的函数这里写的不够简练...，忘掉了...）

代码：（求组合数的复杂度是线性时间）

class Solution {
public:
	int uniquePaths(int m, int n) {
		if (!m || !n) {
			return 0;
		}
		return combination(m + n - 2, m - 1);
	}
	int combination(int n, int x) {
		if (x > n - x) {
			x = n - x;
		}
		long long result = 1, factor = 1, temp = x;
		while(factor <= x || temp) {
			if (temp) {
				result *= (n - temp + 1);
				-- temp;
			}
			while (factor <= x && result % factor == 0) {
				result /= factor;
				++ factor;
			}
		}
		return (int)result;
	}
};