This file contains ambiguous Unicode characters that may be confused with others in your current locale. If your use case is intentional and legitimate, you can safely ignore this warning. Use the Escape button to highlight these characters.
package class29;
public class Problem_0062_UniquePaths {
// m 行
// n 列
// 下：m-1
// 右：n-1
public static int uniquePaths(int m, int n) {
int right = n - 1;
int all = m + n - 2;
long o1 = 1;
long o2 = 1;
// o1乘进去的个数 一定等于 o2乘进去的个数
for (int i = right + 1, j = 1; i <= all; i++, j++) {
o1 *= i;
o2 *= j;
long gcd = gcd(o1, o2);
o1 /= gcd;
o2 /= gcd;
}
return (int) o1;
// 调用的时候，请保证初次调用时，m和n都不为0
public static long gcd(long m, long n) {
return n == 0 ? m : gcd(n, m % n);
