JAVA AC DP solution


  • 3
    S

    You may also use two array to store the status, which may save space however which will lose the intermedia data.

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

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.