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?

Note: m and n will be at most 100.

由于只能向下或向右 所以每一点（i,j） 只有两种方式到达(i-1,j)和(i,j-1)所以采用动态管理 动态方程为 dy[i][j]=dy[i-1][j]+dy[i][j-1] 代码如下:

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