Fork me on GitHub
摘要: 动态规划 Dynamic Programming 1. “Simplifying a complicated problem by breaking it down into simpler sub-problems” (in a recursive manner) 2. Divide & Conq 阅读全文
posted @ 2020-11-30 11:01 kris12 阅读(262) 评论(0) 推荐(0) 编辑
levels of contents