Leetcode 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.

分析：

这道题属于动态规划问题中求所有可能解的类型。用动态规划四步分析法分析：

1. 每个状态代表了这一格所有可能的路径数

2. 当前的状态从左来或从有来，因此 f[i][j] = f[i-1][j] + f[i][j-1]

3. 初始状态，f[i][0] = 1 f[0][j] = 1

4. 答案是最后finish的状态可能的路径数

Java代码实现：

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