{"id":15355676,"url":"https://github.com/songquanpeng/cpp-interview","last_synced_at":"2025-09-13T15:12:13.048Z","repository":{"id":54340938,"uuid":"372714400","full_name":"songquanpeng/cpp-interview","owner":"songquanpeng","description":"C++ 面试准备：常考代码实现，阅读资料以及其他资源的汇总","archived":false,"fork":false,"pushed_at":"2022-09-30T01:11:40.000Z","size":33,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":3,"default_branch":"main","last_synced_at":"2025-02-01T18:45:26.186Z","etag":null,"topics":["cpp","interview"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/songquanpeng.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2021-06-01T05:44:29.000Z","updated_at":"2022-09-24T15:29:12.000Z","dependencies_parsed_at":"2023-01-19T04:02:27.449Z","dependency_job_id":null,"html_url":"https://github.com/songquanpeng/cpp-interview","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/songquanpeng%2Fcpp-interview","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/songquanpeng%2Fcpp-interview/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/songquanpeng%2Fcpp-interview/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/songquanpeng%2Fcpp-interview/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/songquanpeng","download_url":"https://codeload.github.com/songquanpeng/cpp-interview/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245865038,"owners_count":20685158,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["cpp","interview"],"created_at":"2024-10-01T12:25:10.338Z","updated_at":"2025-03-27T14:47:13.841Z","avatar_url":"https://github.com/songquanpeng.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# C++ 面试准备\n\u003e 包含经典代码实现，阅读资料以及其他资源的汇总\n\n## 代码实现\n### 经典算法\n+ [ ] 排序算法\n  + [x] [冒泡排序](./algorithm/bubble_sort.cpp)\n  + [x] [选择排序](./algorithm/selection_sort.cpp)\n  + [x] [插入排序](./algorithm/insertion_sort.cpp)\n  + [x] [希尔排序](./algorithm/shell_sort.cpp)\n  + [x] [归并排序](./algorithm/merge_sort.cpp)\n  + [x] [快速排序](./algorithm/quick_sort.cpp)\n  + [ ] 堆排序\n  + [ ] 计数排序\n  + [ ] 桶排序\n  + [ ] 基数排序\n+ [ ] 字符串算法\n  + [ ] KMP 字符串匹配算法\n+ [ ] 二分搜索（找目标值，找左边界，找右边界）\n+ [ ] 动态规划\n+ [ ] 图算法\n  + [ ] 基本遍历\n    + [ ] 深度优先搜索\n    + [ ] 广度优先搜索\n    + [ ] A* 搜索算法\n    + [ ] 回溯法\n  + [ ] 最短路径算法\n    + [ ] Dijkstra 算法\n    + [ ] Bellman-Ford 算法\n    + [ ] Floyd-Warshall 算法\n  + [ ] 最小生成树\n    + [ ] Prim 算法\n    + [ ] Kruskal 算法\n  + [ ] 图匹配\n    + [ ] 匈牙利算法\n\n### 数据结构\n+ [ ] STL\n  + [x] [string](./stl/string.h)\n  + [ ] vector\n  + [ ] iterator\n  + [x] [unordered_map（哈希表）](./stl/unordered_map.h)\n  + [ ] map（红黑树）\n+ [ ] 并查集\n+ [ ] 堆\n+ [ ] B 树\n\n### 智能指针\n+ [ ] unique_ptr\n+ [ ] shared_ptr\n+ [ ] weak_ptr\n\n### 网络编程\n+ [x] [select](./socket/select.cpp)\n+ [x] [poll](./socket/poll.cpp)\n+ [x] [epoll](./socket/epoll.cpp)\n\n### 并发编程\n+ [x] [互斥锁](./concurrent/mutex.h)\n+ [x] [条件变量](./concurrent/condition_variable.h)\n+ [x] 阻塞队列\n  + [x] [标准库版本](./concurrent/blocking_queue.h)\n  + [x] [POSIX 版本（fixed max size）](./concurrent/posix_blocking_queue.h)\n+ [ ] 线程池\n  + [ ] 标准库版本\n  + [ ] POSIX 版本\n\n### 设计模式\n+ [x] 单例\n  + [x] [懒汉版](./design_pattern/lazy_singleton.cpp)\n  + [x] [饿汉版](./design_pattern/eager_singleton.cpp)\n\n### 其他\n+ [ ] 内存池\n\n## 阅读资料\n### 经典书籍\n+ [ ] 《C++ Primer》\n+ [ ] 《Effective C++》\n+ [ ] 《More Effective C++》\n+ [ ] 《Effective STL》\n+ [ ] 《Effective Modern C++》\n+ [ ] 《C++ 语言的设计与演化》\n+ [ ] 《深度探索 C++ 对象模型》\n+ [ ] 《STL 源码剖析》\n+ [ ] 《C++ 并发编程实战》\n+ [ ] 《C++ 沉思录》\n+ [ ] 《C++ 模版元编程》\n+ [ ] 《C 专家编程》\n+ [ ] 《C 陷阱与缺陷》\n+ [ ] 《C 语言接口与实现》\n\n### 在线教程\n+ [ ] [现代 C++ 教程：高速上手 C++ 11/14/17/20](https://changkun.de/modern-cpp/)\n+ [ ] [OI Wiki](https://oi-wiki.org)\n\n## 参考\n+ [C++ 实现十大排序算法](https://www.cnblogs.com/BobHuang/p/11263183.html)\n+ [图算法领域 10 大经典算法](https://www.cnblogs.com/v-july-v/archive/2011/02/14/1983678.html)\n+ [C++ 单例模式](https://zhuanlan.zhihu.com/p/37469260)","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsongquanpeng%2Fcpp-interview","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsongquanpeng%2Fcpp-interview","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsongquanpeng%2Fcpp-interview/lists"}