几个例题

Loading...
Peking University
4.8 (309 ratings) | 21K Students Enrolled
View Syllabus

Reviews

4.8 (309 ratings)
  • 5 stars
    263 ratings
  • 4 stars
    34 ratings
  • 3 stars
    6 ratings
  • 2 stars
    2 ratings
  • 1 star
    4 ratings
ZW

Oct 04, 2018

It's a valuable experience and I learned a lot about algorithms, thanks you !

ZC

Aug 10, 2017

Prestigious University and of course with technical professors.

From the lesson
动态规划(1)
通过上一模块的学习,你已经了解如何通过递归的办法解决问题,但是单纯的递归往往会导致子问题被重复计算,因此在解决某些问题的时候,效率会很低。而将一个问题分解为子问题递归求解,并且将中间结果保存以避免重复计算的方法就叫做“动态规划”。本模块将初步介绍对于特定的问题如何寻找子问题、定义问题的状态以及状态转移方程。

Taught By

  • Jiaying Liu 刘家瑛, Ph.D.

    Jiaying Liu 刘家瑛, Ph.D.

    Associate Professor
  • 郭 炜

    郭 炜

    讲师

Explore our Catalog

Join for free and get personalized recommendations, updates and offers.