【0520-Week 06】学习总结

[itachieve]

Week 05 Notes

Dynamic Programming

• Defination

  Simplifying a complicated problem by breaking it down into simpler subproblems in a cursive manner

• Practice

  1. Fibonacci Sequence:

      def fib(n):
          if n <= 1:
              return n
  
          if (memo[n] == 0)
              memo[n] = fib(n-1) + fib(n-2)
          return memo[n]

• Template (5-easy steps of DP)

  1. Define subproblems
  2. guess (part of solution)
  3. relate subproblem solutions
  4. recurse & memorize or build DP table bottom-up
  5. solve original problem

Lectures

accepted	index	level	desc	url
[ ]	1143	medium	DP	longest-common-subsequence
[ ]	70	easy	DP	climbing-stairs

[itachieve]

week 06

[fremindmm]

英文可以

[hayatejp]

英文整理的很好，从另一方面认识到了算法