lkasniveの小窝

先说结论

在每个操作均为log复杂度的前提下，set无法在判断顺序和重复关键字不同时完成对结构体元素的去重。

1.引入

现在有两个字符串$A$和$B$，求$B$是否是$A$的子串，如果是，输出第一个匹配的位置$(len_A = n\quad len_B = m)$

$A = bacbababaabcbab$

$B = ababaca$

Welcome to Hexo! This is your very first post. Check documentation for more info. If you get any problems when using Hexo, you can find the answer in troubleshooting or you can ask me on GitHub.

Quick Start

Create a new post

More info: Writing