LeeCode : 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?

代码
动归算法，如果想要继续降低内存，可以使用一维的数组来存储。

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