What is dynamic programming (DP) ?        Has optimal substructure: can be broken into subproblems and find solutions to subproblems      Subproblems are used multiple times : use memorization to compute only once and save time.      Subproblem solutions will not change   Top down:DFS + memorization Bottom up: DP Steps to Solve DP   Definition of … Continue reading Leetcode Dymanic Programming Problems Summary 动态规划总结 →