From 199e9ed50b66a58dcdae9ee85d3dcbf1a900ae4e Mon Sep 17 00:00:00 2001
From: IDEAR1 <wangdongwei1203@gmail.com>
Date: Tue, 25 Aug 2015 11:52:07 +0800
Subject: [PATCH 1/2] fix Longest Palindromic Substring typo

---
 C++/chapString.tex | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/C++/chapString.tex b/C++/chapString.tex
index f6cf67f5..31641708 100644
--- a/C++/chapString.tex
+++ b/C++/chapString.tex
@@ -325,7 +325,7 @@ \subsubsection{分析}
 \end{cases}
 $$
 
-思路三：Manacher’s Algorithm, 复杂度$O(n)$。详细解释见 \myurl{http://leetcode.com/2011/11/longest-palindromic-substring-part-ii.html} 。
+思路四：Manacher’s Algorithm, 复杂度$O(n)$。详细解释见 \myurl{http://leetcode.com/2011/11/longest-palindromic-substring-part-ii.html} 。
 
 
 \subsubsection{备忘录法}

From 3801f1df6e4b53c9d5efbe169d25601d8a702f48 Mon Sep 17 00:00:00 2001
From: IDEAR1 <wangdongwei1203@gmail.com>
Date: Sun, 27 Sep 2015 15:19:23 +0800
Subject: [PATCH 2/2] fix triangle bug

---
 C++/.DS_Store                  | Bin 0 -> 6148 bytes
 C++/chapDynamicProgramming.tex |   2 +-
 C++/images/.DS_Store           | Bin 0 -> 6148 bytes
 3 files changed, 1 insertion(+), 1 deletion(-)
 create mode 100644 C++/.DS_Store
 create mode 100644 C++/images/.DS_Store

diff --git a/C++/.DS_Store b/C++/.DS_Store
new file mode 100644
index 0000000000000000000000000000000000000000..cd3a2cf86a516c8064df523e3cb54a7528c4c45a
GIT binary patch
literal 6148
zcmeHKOKQU~5S>X)F?8c)mbyZ2AcAuOU!aACP{;>bnzdIsSC7^=pN;Ew=WfCq7(Hn;
zPeO0u@ra0SKVLT@ortt>L%G>7H`_O#*(xIngyW38d|Ze3^YL;%%(8zE823@$<RmY0
z_`$b58Wo@dRDcRl0V=Sp0$E?%r)7`jX;gp;+<^l2eJF6lnm7jfrvrnx0Kf)eH_W}4
z02T`XYvLG)2uy<t460^}p+QHyWL`}i1A{J_&4=dAnjMPz?Kr=9x@ZmLNCl|CRDp+B
zc2@s)@IU(hDTym8Kn3nf0d4xB-{MJGTW626T3g`HaLf6En_=!03|@|bUXHP_a=iAW
b$SXF-eoY($osPKEf&3XTU1(I`zZLifv<(%N

literal 0
HcmV?d00001

diff --git a/C++/chapDynamicProgramming.tex b/C++/chapDynamicProgramming.tex
index a6ec1d08..4b3669a6 100644
--- a/C++/chapDynamicProgramming.tex
+++ b/C++/chapDynamicProgramming.tex
@@ -25,7 +25,7 @@ \subsubsection{描述}
 \subsubsection{分析}
 设状态为$f(i, j)$，表示从从位置$(i,j)$出发，路径的最小和，则状态转移方程为
 $$
-f(i,j)=\min\left\{f(i,j+1),f(i+1,j+1)\right\}+(i,j)
+f(i,j)=\min\left\{f(i+1,j),f(i+1,j+1)\right\}+(i,j)
 $$
 
 
diff --git a/C++/images/.DS_Store b/C++/images/.DS_Store
new file mode 100644
index 0000000000000000000000000000000000000000..ef69838bab740e72573f2ca36f75878c664ec310
GIT binary patch
literal 6148
zcmeHK%T60H6g_UUh<H>HtyIKnmTZDVS1d<}B6ZvT0C|kkh$NGy6Y*HhXYf&c0DlwC
zxppCw8Op9gl^ywBkL`0G$1`>ez@09K$3O=_n^n5CMbS_+u39VaLeCDhGaDH)%<vmW
znAc{<j>te{;H@#BZ+8bL=;9Za{Cc0i-x)^VCi$R0$@`q64dR^jaAk!p-~b~m(8CSU
z1LPPI?OWOd3XUz=Utr9!ne7R6oA(<w_wbYRh0cTZDQ)&>E2GrDQnTT{Z`jyvu+fZs
z*g$^4#9|%Mn_}ovF3}I!jOCksSB$WrkDOzgquAyapK|qc1{_z^J!2qa%kPS{=#AC8
zHC8{-LWXOzEUODl%}<X#uQ7SYeB5e93G6W@#VBiCTvFaJliZ>j{)Nf)SU%8uZYbqB
zCH9tfUgmNg+c9iGOkoj>4KHRJ@#4X?*Le77+z;vhlKE>Ta;}aTe}#pLm92`EM$eA#
zPX+UtKD2Uk{{F0|p4Has`-~RNc{sjP6>GK_Z&L8gR%vg09c5%7G7uSfVnF*t!YZ8x
zU3zU>2Zdb$s9Wr|!nXb@2$KYz23>m15f<m6)E?@>6~lQr`;#y)4Z8H&!{Nf^!v)VS
z+)$i(r~SmH!=+wF85xKSR2g{hA3Hk#zrK9`uY%%JWFRu|UoqfXXFtwPnNm1gYsu-X
uO;|5jRWz^k+8`9+IJSn4;(b;t981)oPJ=GJW)DmJBVaT{5gGWW3_Jq665vDt

literal 0
HcmV?d00001