|
所在平台: Udemy |
课程主页: https://www.udemy.com/course/master-the-art-of-dynamic-programming/
课程评论：没有评论
**课程名称：** 动态规划艺术大师 **课程概述：** 本课程旨在帮助学习者掌握动态规划这一编程技巧。动态规划的实现被认为是一门艺术，而非简单的技术。在编码面试中，动态规划问题非常常见，并且通常被认为是面试中最具挑战性的问题之一。然而，一旦深入理解其理论并掌握一些技巧，解决动态规划问题将变得相对容易。课程将强调识别动态规划问题的共性，从而高效地构建解决方案。 **课程将教授：** 1. **动态规划的深入理论：** 全面解析动态规划的核心概念和原理。 2. **递归与回溯技术：** 学习如何运用递归和回溯思维来解决问题。 3. **从零开始构建动态规划解决方案的步骤化方法：** 提供一套系统性的方法，指导学习者如何从一个给定的问题出发，一步一步构建出动态规划解决方案。 4. **一维动态规划问题的应用：** 通过详细的示例，讲解如何应用上述步骤化方法解决一维动态规划问题。 5. **多维动态规划问题的应用：** 同样通过详细的示例，展示如何应用该方法解决多维动态规划问题。 6. **时间和空间复杂度分析：** 学习如何分析递归解决方案以及动态规划解决方案的时间和空间复杂度。 **课程大纲：** (无)
Implementing dynamic programming algorithms is more of an art than just a programming technique. Dynamic programming problems are also very commonly asked in coding interviews but if you ask anyone who is preparing for coding interviews which are the toughest problems asked in interviews most likely the answer is going to be dynamic programming. In fact, dynamic programming problems are very easy to solve once you understand the theory in depth and know certain tricks. Most of the dynamic programming problems share some common elements and if you know how to identify those things you can come up with solutions easily.In this course, you will learn1. The in-depth theory behind dynamic programming 2. Recursion and backtracking techniques3. A step by step approach to come up with dynamic programming solutions to a given problem from scratch4. Applying step by step approach for one-dimensional dynamic programming problems with detailed examples5. Applying step by step approach for multi dimensional dynamic programming problems with detailed examples6. How to analyze the time and space complexities of recursive solutions as well as dynamic programming solutions
