huayu-learn
/
algorithm
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
algorithm/算法/learn/大厂刷题/Five.md

228 B
Raw Blame History

样本对应模型,一般以最后一个划分可能性.

题目三

给定地租船s1和s2,问s2最少删除多少字符串可以成为s1的子串

生成s2的所有子序列,根据长度排序,拿子串和s1做kmp.

子串,