Method value

java/0119-pascals-triangle-ii.java:14–19

(int row, int col, int[][] dp)

    }

    public int value(int row, int col, int[][] dp) {
        if (row == 0 || col == 0 || col == row) return 1;
        if (dp[row][col] != 0) return dp[row][col];
        dp[row][col] = value(row - 1, col - 1, dp) + value(row - 1, col, dp);
        return dp[row][col];
    }

    /** Iterative approach to solving the problem - follows Neetcode's solution in Python
     *  O(n) time complexity