62. Unique Paths

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?

62. Unique Paths_第1张图片

Above is a 3 x 7 grid. How many possible unique paths are there?
Note: m and n will be at most 100.

public class Solution {
    public int uniquePaths(int m, int n) {
      //  if(m==1||n==1)
      //     return 1;
      //  return uniquePaths(m-1,n)+uniquePaths(m,n-1);
      int[][] a = new int[m][n];
      for(int i=0;i

你可能感兴趣的:(62. Unique Paths)