2021-08-05 leetcode notes

Dynamic programming

The dynamic programming algorithm is based on the split problem , Define the relationship between the problem state and the State , So that the problem can be recursively （ Or divide and conquer ） The way to solve . Unlike recursion, the solution of the subproblem is solved only once , From the bottom up .

Fibonacci sequence

Similar topics include climbing stairs, etc

1. Slide array

2. Matrix fast power

Maximal continuous subsequence