LintCode-114动态规划求路径数量

题目

A robot is located at the top-left corner of a m x n grid(网格).
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.
How many possible unique paths are there?

Example

Example 1:
Input: n = 1, m = 3
Output: 1
Explanation: Only one path to target position.
Example 2:
Input: n = 3, m = 3
Output: 6
Explanation:
D : Down
R : Right
1) DDRR
2) DRDR
3) DRRD
4) RRDD
5) RDRD
6) RDDR

Notice
m and n will be at most 100.
The answer is guaranteed to be in the range of 32-bit integers

使用二维数组实现

public class Solution {
   
    /**
     * @param m: positive integer (1 <= m <= 100)
     * @param n: positive integer (1 <= n <= 100)
     * @return: An integer
     */
    public int uniquePaths(int m, int n) {
   
        // write your code here
        
        //机器人起始位置看作(0,0),最终位置(m-1,n-1)
        /*转移方程：f(x,y)表示机器人到达x,y位置的方法数。因为只可能是从上面相邻格(x,y-1)或者左边相邻格(x-1,y)走一步过来的，所以f(x,y)=f(x,y-1)+f(x-1,y);
        */
        int[][] wayTo=