Hearod的博客

Text and figures are summrized from the book - Data Structure and Algorithm Analysis in C++ Ch.10.2.2. Code are referred from Rosetta Code. Given N points in a plane, the closest pair of points can be found in O(NlogN)O(N log N)O(NlogN) time. exhaustive s

Manacher’s Algorithm Reference：Link1(BIT祝威), Link2。图片及部分文字陈述参考自Link1, 数学推导参考自Link2。 Introduction Given a string S with the length of N. 化一般为特殊。 在字符串S的每个字符之间以及S的首位都插入一个特殊字符，该字符绝不会在S中出现，比如"#"。得到字符串T。T.length=2N+1T.length = 2N+1T.length=2N+1。 例如: S=“abaaba”

本人愚钝，cplusplus.com的描述及各种问答网站上关于智能指针的回答实在不好理解，幸而发现了这个解释，通俗易懂，总结如下。 Referred and Concluded from YouTuber CppNuts. Introduction Smart pointer is a class which wraps a raw pointer, to manage the life time of the pointer. 以下例子可以方便理解，即使不写delete sp, 在执行完main后也会自动