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 7 x 3 grid. How many possible unique paths are there?

Note: m and n will be at most 100.

Example 1:

Input: m = 3, n = 2
Output: 3
Explanation:
From the top-left corner, there are a total of 3 ways to reach the bottom-right corner:
1. Right -> Right -> Down
2. Right -> Down -> Right
3. Down -> Right -> Right

Example 2:

Input: m = 7, n = 3
Output: 28

解析：这道题适合用动态规划。分解方法如下：很容易会想到，从原点到某一点（m,n）的路径数量f(m,n)等于原点到点（m-1,n）的路径数加上原点到点（m,n+1）的路径数，也就是f(m,n) = f(m-1, n) + f(m, n-1)，时间复杂度是o(mn)，代码如下：

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

			}
		}
        return res[m-1][n-1];
    }
}

解析2：看解答，有一种基于解析1的优化方法，下次看这题时填坑:)