|
所在平台: Udemy |
课程主页: https://www.udemy.com/course/recurofy-learn-recursion-and-dynamic-programming/
课程评论:没有评论
**课程名称:** Recurofy: 学习递归与动态规划 **课程概述:** 本课程旨在帮助学习者以更有效的方式掌握递归和动态规划这两个在编程面试中具有挑战性的主题。讲师在准备面试的过程中,发现掌握这些概念需要数周时间,因此开发了一套解决这类问题的通用框架。 课程将递归算法分为两大类:“自相似算法”和“决策树算法”。 * **自相似算法** 适用于问题本身与其子问题之间存在明显相似性关系的场景。 * **决策树算法** 则通过“尝试”系统中所有可能的决策序列来解决问题。 课程将首先建立坚实的递归基础,即使是通常被归类为动态规划的问题,也将通过递归的方法来解决。在此基础上,学习者将进一步掌握如何利用动态规划来优化递归算法。 **先修要求:** * **Python 基础:** 需要对 Python 语言有基本的了解。 * **时间与空间复杂度:** 需要有对非递归情况下的时间与空间复杂度分析的基本理解。 * **数据结构与算法:** 需要对哈希表、树结构等非递归数据结构和算法有基本的了解。
When I was preparing for coding interviews a while back, I found recursion and dynamic programming to be among the hardest topics covered. It felt like it took me weeks to get good at solving these types of problems. After I finished preparing for interviews, I thought there must be an easier way for someone to learn how to solve these types of problems, so they can learn this much quicker. After solving more than 100 recursive and dynamic programming problems, I created a problem-solving framework that you can use to solve these types of problems.This course teaches you this framework by first splitting up all recursive algorithms into two types: self-similar algorithms and decision tree algorithms. Self-similar algorithms solve problems where there is an easy to see self-similar relationship with the problem itself we are solving for, and decision tree algorithms solve problems by 'trying' every possible decision sequence in a system. We will spend time building a strong foundation on how to solve problems with recursion (even problems that are typically referred to as dynamic programming problems), and then, with a strong foundation, we will learn how to improve our recursive algorithms with dynamic programming.Prerequisites:The course uses Python, requiring only a basic understanding of the language.A basic understanding of non-recursive space and time complexity.A basic understanding of non-recursive data structures and algorithms, such as hash tables and tree structures, is required.