8000 Merge pull request #71 from idear1203/master · soulmachine/leetcode@967fdd4 · GitHub
[go: up one dir, main page]
Skip to content

Commit 967fdd4

Browse files
soulmachinesoulmachine
committed
Merge pull request #71 from idear1203/master
fix Longest Palindromic Substring typo
2 parents 25c3dac + 3801f1d commit 967fdd4

File tree

4 files changed

+2
-2
lines changed

4 files changed

+2
-2
lines changed

‎C++/.DS_Store

6 KB
Binary file not shown.

‎C++/chapDynamicProgramming.tex

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -25,7 +25,7 @@ \subsubsection{描述}
2525
\subsubsection{分析}
2626
设状态为$f(i, j)$，表示从从位置$(i,j)$出发，路径的最小和，则状态转移方程为
2727
$$
28-
f(i,j)=\min\left\{f(i,j+1),f(i+1,j+1)\right\}+(i,j)
28+
f(i,j)=\min\left\{f(i+1,j),f(i+1,j+1)\right\}+(i,j)
2929
$$
3030

3131

‎C++/chapString.tex

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -325,7 +325,7 @@ \subsubsection{分析}
325325
\end{cases}
326326
$$
327327

328-
思路三：Manacher’s Algorithm, 复杂度$O(n)$。详细解释见 \myurl{http://leetcode.com/2011/11/longest-palindromic-substring-part-ii.html} 。
328+
思路四：Manacher’s Algorithm, 复杂度$O(n)$。详细解释见 \myurl{http://leetcode.com/2011/11/longest-palindromic-substring-part-ii.html} 。
329329

330330

331331
\subsubsection{备忘录法}

‎C++/images/.DS_Store

6 KB
Binary file not shown.

0 commit comments

Comments
 (0)
0