[Leetcode] Unique Paths (Java)

最新推荐文章于 2024-10-16 10:13:45 发布

草鞋大脚

最新推荐文章于 2024-10-16 10:13:45 发布

阅读量628

点赞数

分类专栏： Leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/StarCXDJ/article/details/18033579

版权

Leetcode 专栏收录该内容

150 篇文章 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.

计算C(min(m-1,n-1),m+n-2)

public class Solution {
    public int uniquePaths(int m, int n) {
		long res = 1;
		int high = m+n-2;
		int low = Math.min(m-1, n-1);
		int k=0;
		while(k++<low)
			res*=high--;
		for(int i=low;i>0;i--)
			res/=i;
		return (int)res;
    }
}