Pinned Repositories
BKTree
A simple implementation of BKTree in C++20.
Caches
A toy implementation of cache using FILO, FIFO, LRU and LFU policies in C++.
clean-go-article
A reference for the Go community that covers the fundamentals of writing clean code and discusses concrete refactoring examples specific to Go.
Collection_of_my_coding_practice
A collection of my coding practice
Collection_of_my_coding_practice_Backup
Another repo of my code backup.
ddia
《Designing Data-Intensive Application》DDIA中文翻译
DotsLockCracker
a CLI app that helps players unlock dots lock quickly in **Atomic Heart**
Dynamic_TopK_Ranking_Service
A web service used to dynamically calculate and return the top-k most mentioned strings along with their mention counts.
EffectiveModernCppChinese
《Effective Modern C++》翻译 - 已完成
Food-Delivery-App
H-Shen's Repositories
H-Shen/Collection_of_my_coding_practice
A collection of my coding practice
H-Shen/BKTree
A simple implementation of BKTree in C++20.
H-Shen/Caches
A toy implementation of cache using FILO, FIFO, LRU and LFU policies in C++.
H-Shen/clean-go-article
A reference for the Go community that covers the fundamentals of writing clean code and discusses concrete refactoring examples specific to Go.
H-Shen/Collection_of_my_coding_practice_Backup
Another repo of my code backup.
H-Shen/ddia
《Designing Data-Intensive Application》DDIA中文翻译
H-Shen/DotsLockCracker
a CLI app that helps players unlock dots lock quickly in **Atomic Heart**
H-Shen/Dynamic_TopK_Ranking_Service
A web service used to dynamically calculate and return the top-k most mentioned strings along with their mention counts.
H-Shen/EffectiveModernCppChinese
《Effective Modern C++》翻译 - 已完成
H-Shen/Food-Delivery-App
H-Shen/H-Shen.github.io
H-Shen/K-Way-Merger
A toy implementation of k-way merger in Go
H-Shen/OI-wiki
:star2: Wiki for OI / ICPC. （某大型游戏线上攻略，内含炫酷算术魔法）
H-Shen/Rational
An implementation of Arbitrary-Precision Fraction in Java
H-Shen/WordAdvisorLib
a Python library of C++ code that provides functionality to find the closest word match for a given input word using Levenshtein distance.