|
所在平台: Udemy |
课程主页: https://www.udemy.com/course/dynamic-programming-for-solving-problems/
课程评论：没有评论
**动态规划问题求解课程总结** 本课程《动态规划问题求解》(Dynamic Programming for Solving Problems) 旨在帮助学习者掌握动态规划这一强大的算法思想，尤其适合有数月编程基础，熟悉条件语句和循环等基本概念的学习者。课程的核心在于理解动态规划的解题思路，并将在C++中实现所学的算法。 **课程内容重点：** * **动态规划核心理念：** 课程将深入探讨动态规划作为一种数学优化和计算机编程方法，强调子问题与父问题之间的关系，并涉及贝尔曼方程的概念。 * **两种实现方法：** 学习者将掌握两种动态规划的应用方式：自顶向下（Top Down）和自底向上（Bottom Up）。 * **典型问题解析：** 课程将通过一系列经典的动态规划问题进行讲解和实践，包括： * 0-1 背包问题（含1小时视频详解） * 动态规划求解斐波那契数列 * 最长公共子序列问题 * 青蛙过河问题 (Frog's Staircase to Heaven) * 网格行走问题 (Grid Walking Problem) * 股票买卖问题 (Stock Buy Sell Problem) * 硬币找零问题 (The Coin Change Problem) * 区间求和问题（无更新操作） 本课程将引导您开启动态规划的学习之旅，欢迎您即刻开始学习！
Welcome to my course on 'Dynamic Programming for Solving Problems'This course is specifically designed for those who have started Programming a few months ago. You are expected to know the basics of Programming like Conditional Statements, Loops etc. just to understand the implementation part. Yet, It is not going to be an integral part. Understanding the approach of Dynamic Programming will be our primary focus. We will be implementing the algorithm we have derived, in C++.The problems that we will be solving in this course are:1. 0-1 Knapsack Problem (A Complete Explanation having a 1 hour video) 2. Fibonacci Series using Dynamic Programming3. Longest Common Subsequence Problem4. Frog's Staircase to Heaven5. Grid Walking Problem6. Stock Buy Sell Problem7. The Coin Change Problem8. Range Sum Making Queries without updates.Dynamic programming is both a mathematical optimization method and a computer programming method. If sub-problems can be nested recursively inside larger problems, so that dynamic programming methods are applicable, then there is a relation between the value of the larger problem and the values of the sub-problems. In the optimization literature this relationship is called the Bellman equation.There are two ways in which we can apply the paradigm of Dynamic Programming:1. Top down Approach2. Bottom up ApproachWhat are you waiting for? Start Learning the course now!
