[LeetCode] Unique Paths

Total Accepted: 9992 Total Submissions: 32850

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.

public class Solution {
    public int uniquePaths(int m, int n) {
        if (m < 0 || n < 0)     throw new IllegalArgumentException();
        if (m == 0 || n == 0)   return 0;
        
        // paths from (0, 0) to current node in the row
        int[] dp = new int[n];
        
        for (int i = 0; i < n; i++) dp[i] = 1;
        
        for (int i = 1; i < m; i++) {
            for (int j = 0; j < n; j++) {
                if (j == 0) dp[j] = 1;
                else        dp[j] += dp[j-1];
            }
        }
        
        return dp[n-1];
    }
}