7 line simple DP Java


  • 0
    M
        public int uniquePaths(int m, int n) {
            int[] dp = new int[n+1];
            Arrays.fill(dp, 1);
            dp[0] = 0;
            for(int i=1;i<m;i++)
                for(int j=1;j<=n;j++)
                    dp[j]+=dp[j-1];
            return dp[n];
        }
    

  • 0
    F

    You don't need to set dp[0] to zero.

    public int uniquePaths(int m, int n) {
            int[] dp = new int[n + 1];
            Arrays.fill(dp, 1);
            for (int i = 1; i < m; i++) {
                for (int j = 1; j < n; j++) {
                    dp[j] += dp[j - 1];
                }
            }
            return dp[n - 1];
        }
    

Log in to reply
 

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