From 52ed0ac5d318f8efcde282d71d5408501ecdfba4 Mon Sep 17 00:00:00 2001
From: hengzzha <80679845+hengzzha@users.noreply.github.com>
Date: Sun, 4 Jul 2021 09:03:43 +0800
Subject: [PATCH] =?UTF-8?q?Update=20=E5=8A=A8=E6=80=81=E8=A7=84=E5=88=92-?=
 =?UTF-8?q?=E8=82=A1=E7=A5=A8=E9=97=AE=E9=A2=98=E6=80=BB=E7=BB=93=E7=AF=87?=
 =?UTF-8?q?.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

冗余代码
---
 problems/动态规划-股票问题总结篇.md | 6 ------
 1 file changed, 6 deletions(-)

diff --git a/problems/动态规划-股票问题总结篇.md b/problems/动态规划-股票问题总结篇.md
index d22132c0..590a8008 100644
--- a/problems/动态规划-股票问题总结篇.md
+++ b/problems/动态规划-股票问题总结篇.md
@@ -375,12 +375,6 @@ p[i][3] = dp[i - 1][2];
 
 综上分析，递推代码如下：
 
-```C++
-dp[i][0] = max(dp[i - 1][0], max(dp[i - 1][3], dp[i - 1][1]) - prices[i];
-dp[i][1] = max(dp[i - 1][1], dp[i - 1][3]);
-dp[i][2] = dp[i - 1][0] + prices[i];
-dp[i][3] = dp[i - 1][2];
-```
 ```C++
 dp[i][0] = max(dp[i - 1][0], max(dp[i - 1][3]- prices[i], dp[i - 1][1]) - prices[i];
 dp[i][1] = max(dp[i - 1][1], dp[i - 1][3]);