Leetcode dynamic programming

Dynamic domestication ：
Application scenarios ： Once subsequences and maxima are involved, they are usually used as dynamic regression .
The problem solving steps ： determine base case, Determine the state transfer equation .
dp Two forms of array definition ： A one-dimensional dp( Single string character ), A two-dimensional dp( Two strings of characters ).
300 The longest increasing subsequence

https://leetcode-cn.com/problems/longest-increasing-subsequence/solution/zui-chang-di-zeng-zi-xu-lie-dong-tai-gui-e4p0/
Definition ：dp[i] yes nums[0...i] The longest increment number .
step 1: determine base case,dp[i] by 1;
step 2: Determine the state transition , Find the front than nums[i] A small number corresponds to dp Maximum value , Add 1 That is to say dp[i];