本文共 542 字，大约阅读时间需要 1 分钟。

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.

题解：

ACcode:

public class Solution62 {	 public int uniquePaths(int m, int n) {		  int[] path[] = new int[m][n];  		    for(int i=0;i

转载地址：https://blog.csdn.net/zxdfc/article/details/48266565 如侵犯您的版权，请留言回复原文章的地址，我们会给您删除此文章，给您带来不便请您谅解！