Backups/CS-Notes
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

auto commit

Browse Source
This commit is contained in:
CyC2018 2018-02-28 16:25:18 +08:00
parent 3f067718ee
commit c855c2b32c
1 changed files with 1 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
notes/Leetcode 题解.md
View File

@ -2000,13 +2000,7 @@ public int wiggleMaxLength(int[] nums) {
综上，最长公共子系列的状态转移方程为：
$$
dp[i][j]=\left\{
\begin{array}{rcl}
dp[i-1][j-1] && { S1_i==S2_j }\\
max(dp[i-1][j], dp[i][j-1]) &&{ S1_i <> S2_j }
\end{array} \right.
$$
<div align="center"><img src="https://latex.codecogs.com/gif.latex?dp[i][j]=\left\{\begin{array}{rcl}dp[i-1][j-1]&&{S1_i==S2_j}\\max(dp[i-1][j],dp[i][j-1])&&{S1_i<>S2_j}\end{array}\right."/></div> <br>
![](https://github.com/CyC2018/InterviewNotes/blob/master/pics//1dc481cc-99f6-4fa8-8f68-fbd563995bf5.png)