2022-11-23 03:56:25 +08:00
< p align = "center" >
2022-11-23 15:50:59 +08:00
< a href = "https://www.hello-algo.com/" >
2022-11-24 19:32:32 +08:00
< img src = "docs/index.assets/conceptual_rendering.png" width = "230" >
2022-11-23 03:56:25 +08:00
< / a >
< / p >
2022-11-24 22:16:11 +08:00
< h3 align = "center" >
2022-11-23 03:56:25 +08:00
《 Hello, 算法 》
2022-11-24 22:16:11 +08:00
< / h3 >
2022-11-23 03:56:25 +08:00
< p align = "center" >
动画图解、能运行、可讨论的< / br > 数据结构与算法快速入门教程
< / p >
2022-11-24 22:16:11 +08:00
< / br >
< p align = "center" >
< img src = "docs/index.assets/animation.gif" width = "700" >
< / p >
2022-11-23 03:56:25 +08:00
< p align = "center" >
< em >
2022-11-23 21:39:39 +08:00
前往阅读 >
2022-11-23 15:50:59 +08:00
< a href = "https://www.hello-algo.com/" >
hello-algo.com
2022-11-23 03:56:25 +08:00
< / a >
< / em >
< / p >
2022-11-25 14:08:00 +08:00
## 关于本书
2022-11-24 19:32:32 +08:00
2022-11-28 03:46:01 +08:00
本书致力于达成以下目标:
2022-11-24 19:32:32 +08:00
2022-11-28 03:58:22 +08:00
- 开源免费,所有同学都可在网上获取本书;
- 新手友好,适合算法初学者自主学习入门;
- 动画讲解,尽可能地保证平滑的学习曲线;
- 代码导向,提供精简、可运行的算法代码;
- 讨论学习,提问一般能在三日内得到回复;
2022-11-24 19:32:32 +08:00
2022-11-28 03:46:01 +08:00
我们正在加速更新本书,期待您来[一起参与创作](https://www.hello-algo.com/chapter_preface/contribution/),以帮助其他读者获取更优质的学习内容:
2022-11-24 19:32:32 +08:00
2022-11-28 01:13:11 +08:00
- 如果发现笔误、无效链接、内容缺失、文字歧义、解释不清晰等问题,烦请您帮忙修正;
- 欢迎您通过提交 Pull Request 来增添新内容,包括重写章节、新增章节、翻译代码至不同语言等;
> 有任何问题请与我联系 WeChat: krahets-jyd
如果感觉本书对你有所帮助,请点个 Star :star: 支持一下,谢谢!
2022-11-17 15:32:50 +08:00
2022-11-25 14:08:00 +08:00
## 致谢
2022-11-24 22:10:14 +08:00
2022-11-25 13:01:14 +08:00
感谢本开源书的每一位撰稿人,是他们的无私奉献让这本书变得更好,他们是:
< a href = "https://github.com/krahets/hello-algo/graphs/contributors" >
< img src = "https://contrib.rocks/image?repo=krahets/hello-algo" / >
< / a >
2022-11-24 22:10:14 +08:00
2022-11-25 14:08:00 +08:00
## To-Dos
2022-11-27 04:19:16 +08:00
- [x] [代码翻译 ](https://github.com/krahets/hello-algo/issues/15 )( JavaScript, TypeScript, C, C++, C#, ... 寻求大佬帮助)
2022-11-25 14:08:00 +08:00
- [ ] 数据结构:散列表、堆(优先队列)、图
- [ ] 算法:搜索与回溯、选择 / 堆排序、动态规划、贪心、分治
2022-11-17 15:32:50 +08:00
## License
2022-11-29 23:13:39 +08:00
The texts, codes, images, photos, and videos in this repository are licensed under [CC BY-NC-SA-4.0 ](https://creativecommons.org/licenses/by-nc-sa/4.0/ ).