LeetCode 62. Unique Paths（唯一路线）

原题网址：https://leetcode.com/problems/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.

方法一：动态规划。

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

方法二：动态规划，优化内存。

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