Unique Paths (Java)

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.

跟 minimum path sum那道题类似，不同的是边界赋值或者说是dp整体赋值的时候不再是累加或是Integer.MAX_VALUE，而是集体赋值为1，动态转移方程也变为dp[i][j] = dp[i - 1][j] + dp[i][j - 1]。

Source

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

Test

   public static void main(String[] args){
    	int m = 3, n = 3;
    	System.out.println(new Solution().uniquePaths(m, n));
    }