Dynamic Programming

Concept:

• By solving sub-problems one time and reusing these solutions to reduce required run-time.
• Re-computations of same sub-problems can be avoided by constructing a temporary array m[][].
• Bottom-up

References

• 演算法筆記