[LeetCode]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?

Above is a 3 x 7 grid. How many possible unique paths are there?

采用动态规划的方法

每一个格子拥有的走法的种类是它左边的格子拥有的方法加上它上边的格子拥有的方法；

而最左边和最上边的一排，每一个格子拥有的走法数目都是1；

代码如下：

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