408/2021-Postgraduate-408
1
0
Fork 0
mirror of https://github.com/hao14293/2021-Postgraduate-408.git synced 2026-02-03 02:23:40 +08:00
Code Issues Projects Releases Wiki Activity

Update Manacher算法.md

Browse Source
This commit is contained in:
hao14293
2019-06-29 10:16:18 +08:00
committed by GitHub
parent 46d173ef86
commit e5258651cb
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
Algorithm/Manacher算法.md
View File

@@ -134,4 +134,4 @@ while(s_new[i - p[i]] == s_new[i + p[i]])
同理，我们也很容易知道最佳情况下的时间复杂度，即字符串内字符各不相同的时候。推算得平均访问每个字符 4 次，即时间复杂度为：<code>T<sub>best</sub>(n)=O(n)</code>。
综上，Manacher 算法的时间复杂度为 <code>O(n)</code>。
[原文](https://subetter.com/algorithm/manacher-algorithm.html)
原文[https://subetter.com/algorithm/manacher-algorithm.html](https://subetter.com/algorithm/manacher-algorithm.html)