algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-25 09:42:16 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update

Browse Source
This commit is contained in:
youngyangyang04
2020-09-23 15:24:44 +08:00
parent 46c6c7c8e6
commit 4aea70887c
11 changed files with 219 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
problems/0028.实现strStr().md
View File

@ -27,6 +27,11 @@ https://leetcode-cn.com/problems/implement-strstr/
本题是KMP 经典题目。
以下文字如果看不进去，可以看我的B站视频：
* [帮你把KMP算法学个通透！B站（理论篇）](https://www.bilibili.com/video/BV1PD4y1o7nd/)
* [帮你把KMP算法学个通透！（求next数组代码篇）](https://www.bilibili.com/video/BV1M5411j7Xx)
KMP的经典思想就是:**当出现字符串不匹配时，可以记录一部分之前已经匹配的文本内容，利用这些信息避免从头再去做匹配。**
本篇将以如下顺序来讲解KMP，