leetcode

一. General Idea DP ≈ recursion + memorization + guessingmemorize(remember) & reuse solutions to subproblems that help solve the problem.time = #subproblems * time/subproblem, treating recursive call as Θ(1). Bottom-up…