- 博客(5)
- 收藏
- 关注
原创 Closest Point Problem
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
2021-04-24 06:56:41 263
原创 Keil MDK - Installation
1. IntroductionHere is the website. MDK means Microcontroller Development Kit. Keil MDK是应用最广泛的针对ARM架构微处理器的IDE(Integrated Development Environment)。本文是讲述在Win10下如何安装MDK532.2. Download & InstallDownloadYou can download the installation pack form the w
2020-11-13 06:59:14 408
原创 Notebook - Linear Algebra Done Right 3rd
在学Sheldon Axler的Linear Algebra Done Right 3rd。这是一本非常好的线性代数教材,强调理论而不是计算,从Vector Space讲起,一步步深入。事实上,知道我开始学习这本书,才真正理解线性的含义。但是,书中定理的证明有些地方不甚清晰,在此对这些地方做补充说明。3.A The vector space of linear maps3.5 Linear maps and basis of domainAt first, I’m confused by the pr
2020-10-16 20:14:33 573
原创 Leetcode 5. Longest Palindromic Substring - Manacher‘s Algorithm
Manacher’s AlgorithmReference:Link1(BIT祝威), Link2。图片及部分文字陈述参考自Link1, 数学推导参考自Link2。IntroductionGiven a string S with the length of N.化一般为特殊。在字符串S的每个字符之间以及S的首位都插入一个特殊字符,该字符绝不会在S中出现,比如"#"。得到字符串T。T.length=2N+1T.length = 2N+1T.length=2N+1。例如: S=“abaaba”
2020-08-31 07:05:06 380 1
原创 C++ Smart Pointer 智能指针
本人愚钝,cplusplus.com的描述及各种问答网站上关于智能指针的回答实在不好理解,幸而发现了这个解释,通俗易懂,总结如下。Referred and Concluded from YouTuber CppNuts.IntroductionSmart pointer is a class which wraps a raw pointer, to manage the life time of the pointer. 以下例子可以方便理解,即使不写delete sp, 在执行完main后也会自动
2020-06-18 04:46:21 207
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人