mac119
diff --git a/‎C++/chapString.tex
+1-1 b/‎C++/chapString.tex
+1-1
@@ -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{备忘录法}