mirror of
https://github.moeyy.xyz/https://github.com/trekhleb/javascript-algorithms.git
synced 2024-11-10 11:09:43 +08:00
change '克努斯-莫里斯-普拉特算法' to 'KMP算法' (#208)
In China, we usually call it 'KMP算法', So I chose to use a free translation instead of a literal translation. and I may submit content about Chinese translations more frequently recently.
This commit is contained in:
parent
ec6c427303
commit
c4458e9d42
@ -73,7 +73,7 @@ _Read this in other languages:_
|
|||||||
* **字符串**
|
* **字符串**
|
||||||
* `A` [莱温斯坦距离](src/algorithms/string/levenshtein-distance) - 两个序列之间的最小编辑距离
|
* `A` [莱温斯坦距离](src/algorithms/string/levenshtein-distance) - 两个序列之间的最小编辑距离
|
||||||
* `B` [汉明距离](src/algorithms/string/hamming-distance) - 符号不同的位置数
|
* `B` [汉明距离](src/algorithms/string/hamming-distance) - 符号不同的位置数
|
||||||
* `A` [克努斯-莫里斯-普拉特算法](src/algorithms/string/knuth-morris-pratt) - 子串搜索
|
* `A` [KMP算法](src/algorithms/string/knuth-morris-pratt) (克努斯-莫里斯-普拉特算法) - 子串搜索 (模式匹配)
|
||||||
* `A` [字符串快速查找](src/algorithms/string/rabin-karp) - 子串搜索
|
* `A` [字符串快速查找](src/algorithms/string/rabin-karp) - 子串搜索
|
||||||
* `A` [最长公共子串](src/algorithms/string/longest-common-substring)
|
* `A` [最长公共子串](src/algorithms/string/longest-common-substring)
|
||||||
* `A` [正则表达式匹配](src/algorithms/string/regular-expression-matching)
|
* `A` [正则表达式匹配](src/algorithms/string/regular-expression-matching)
|
||||||
|
Loading…
Reference in New Issue
Block a user