Skip to content
Toggle navigation
P
Projects
G
Groups
S
Snippets
Help
李楚霏
/
leetCode_Solution_Record
This project
Loading...
Sign in
Toggle navigation
Go to a project
Project
Repository
Issues
0
Merge Requests
0
Pipelines
Wiki
Snippets
Members
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Commit
324194ef
authored
Nov 02, 2020
by
李楚霏
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
summary
parent
b27853ca
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
12 additions
and
0 deletions
+12
-0
70works/week9/第9周学习总结.md
+12
-0
No files found.
70works/week9/第9周学习总结.md
0 → 100644
View file @
324194ef
### 第9周学习总结
### 第9周学习总结
-
动态规划
-
不同路径ii的状态转移方程: dp
[
i
][
j
]
= dp
[
i-1
][
j
]
+ dp
[
i
][
j-1
]
; dp
[
i
][
j
]
代表到达(i,j)的路径数
-
字符串
-
字符串匹配算法
-
boyer—more算法:
-
此算法主要是要根据好后缀规则和坏前缀规则,从这两者中取搜索词位移的最大值来滑动字符串进行匹配。好后缀是从搜索词最后一位开始,查看是否在字符串最开始也出现过。而坏前缀,如果在比较字符串过程中,搜索词当前字符和原词当前字符匹配不上,就要根据坏前缀原则向前滑动 :搜索词字符但前位置 - 上一次搜索词字符出现的位置;直到匹配结束。
-
kmp算法
-
前缀:除了最后一个字符外的全部头部组合;后缀:除第一个字符外的全部尾部组合;部分匹配值:就是前缀和后缀的最长共有元素组成的长度;搜索词当前字符如果与原词当前字符不匹配的话,就从获得的部分匹配值表中得到匹配值,则搜索词下次移动的距离就为 以匹配的字符数 - 搜索词当前字符的匹配值
\ No newline at end of file
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment