Open itachieve opened 4 years ago
Defination
Simplifying a complicated problem by breaking it down into simpler subproblems in a cursive manner
Practice
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)
week 06
英文可以
英文整理的很好,从另一方面认识到了算法
Week 05 Notes
Dynamic Programming
Defination
Simplifying a complicated problem by breaking it down into simpler subproblems in a cursive manner
Practice
Template (5-easy steps of DP)
Lectures