1. 学习内容

1.1 参考
  1. 《程序设计基础》第14章
  2. 动态规划与斐波那契数列
1.2 算法简介

(来自Quora的问题回答)How should I explain dynamic programming to a 4-year-old?

writes down “1+1+1+1+1+1+1+1 =” on a sheet of paper

“What’s that equal to?”

counting “Eight!”

writes down another “1+” on the left

“What about that?”

quickly “Nine!”

“How’d you know it was nine so fast?”

“You just added one more”

“So you didn’t need to recount because you remembered there were eight! Dynamic Programming is just a fancy way to say ‘remembering stuff to save time later’”

参考:知乎:如何理解动态规划?

2. 编程

  1. 菲波那契数列
  2. 爬楼梯
  3. 台阶问题
  4. [NOIP2002 普及组] 过河卒