feat: initialize intro page (doocs#2237)

Author: yanglbme

docs-en/index.md

@@ -1 +1,52 @@
-# LeetCode EN Wiki
+<p align="center">
+  <a href="https://github.com/doocs/leetcode"><img src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/images/leetcode-doocs.png" alt="LeetCode-GitHub-Doocs"></a>
+</p>
+
+<p align="center">
+  <a href="https://doocs.github.io/#/?id=how-to-join"><img src="https://img.shields.io/badge/organization-join%20us-4051B5?style=flat-square" alt="open-source-organization"></a>
+  <a href="https://github.com/doocs/leetcode"><img src="https://img.shields.io/badge/langs-Python%20%7C%20Java%20%7C%20C++%20%7C%20Go%20%7C%20TypeScript%20%7C%20Rust%20%7C%20...-red?style=flat-square&color=4051B5" alt="languages"></a>
+  <a href="https://github.com/doocs/leetcode/blob/main/LICENSE"><img src="https://img.shields.io/github/license/doocs/leetcode?color=4051B5&style=flat-square" alt="LICENSE"></a><br>
+  <a href="https://opencollective.com/doocs-leetcode/backers/badge.svg" alt="backers on Open Collective"><img src="https://img.shields.io/opencollective/backers/doocs-leetcode?color=4051B5&style=flat-square&logo=open%20collective&logoColor=ffffff" /></a>
+  <a href="https://github.com/doocs/leetcode/stargazers"><img src="https://img.shields.io/github/stars/doocs/leetcode?color=4051B5&logo=github&style=flat-square" alt="stars"></a>
+  <a href="https://github.com/doocs/leetcode/network/members"><img src="https://img.shields.io/github/forks/doocs/leetcode?color=4051B5&logo=github&style=flat-square" alt="forks"></a>
+  <a href="https://opencollective.com/doocs-leetcode/sponsors/badge.svg" alt="Sponsors on Open Collective"><img src="https://img.shields.io/opencollective/sponsors/doocs-leetcode?color=4051B5&style=flat-square&logo=open%20collective&logoColor=ffffff" /></a>
+</p>
+
+## Introduction
+
+Welcome to LeetCode Wiki!
+
+This project contains solutions for problems from LeetCode, "Coding Interviews (2nd Edition)", "Coding Interviews (Special Edition)", "Cracking the Coding Interview (6th Edition)", etc. All solutions are implemented in multiple programming languages, including but not limited to: Java, Python, C++, Go, TypeScript, Rust. We are working hard to update, welcome to Star 🌟 and follow [this project](https://github.com/doocs/leetcode) to get the latest updates.
+
+## Stargazers over time
+
+<!-- <a href="https://github.com/doocs/leetcode/stargazers" target="_blank"><img src="https://starchart.cc/doocs/leetcode.svg" alt="Stargazers over time" /></a> -->
+
+<!-- [![Star History Chart](https://api.star-history.com/svg?repos=doocs/leetcode&type=Date)](https://star-history.com/#doocs/leetcode) -->
+
+<a href="https://github.com/doocs/leetcode/stargazers" target="_blank"><img src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/images/starcharts.svg" alt="Stargazers over time" /></a>
+
+## Backers & Sponsors
+
+Thank you to all our backers and sponsors!
+
+<a href="https://opencollective.com/doocs-leetcode/backers.svg?width=890" target="_blank"><img src="https://opencollective.com/doocs-leetcode/backers.svg?width=890"></a>
+
+<a href="https://opencollective.com/doocs-leetcode/sponsors.svg?width=890" target="_blank"><img src="https://opencollective.com/doocs-leetcode/sponsors.svg?width=890"></a>
+
+> "_You help the developer community practice for interviews, and there is nothing better we could ask for._" -- [Alan Yessenbayev](https://opencollective.com/alan-yessenbayev)
+
+## Copyright
+
+The copyright of this project belongs to [Doocs](https://github.com/doocs) community. For commercial reprints, please contact [@yanglbme](mailto:contact@yanglibin.info) for authorization. For non-commercial reprints, please indicate the source.
+
+## Contact Us
+
+We welcome everyone to add @yanglbme's personal WeChat (WeChat ID: YLB0109), with the note "leetcode". In the future, we will create algorithm and technology related discussion groups, where we can learn and share experiences together, and make progress together.
+
+| <img src="https://cdn-doocs.oss-cn-shenzhen.aliyuncs.com/gh/doocs/images/qrcode-for-yanglbme-en.png" width="260px" align="left"/> |
+| --------------------------------------------------------------------------------------------------------------------------------- |
+
+## License
+
+This work is licensed under a <a rel="license" href="http://creativecommons.org/licenses/by-sa/4.0/">Creative Commons Attribution-ShareAlike 4.0 International License</a>.

docs-en/intro/contribution.md

@@ -0,0 +1,21 @@
+## Our Top Contributors
+
+This project exists thanks to all the people who contribute.
+
+<a href="https://github.com/doocs/leetcode/graphs/contributors" target="_blank"><img src="https://contrib.rocks/image?repo=doocs/leetcode&max=500" /></a>
+
+## Contributions
+
+We're looking for long-term contributors/partners to this repo! Send me [PRs](https://github.com/doocs/leetcode/pulls) if you're interested! See the following:
+
+1. Fork [this repository](https://github.com/doocs/leetcode) to your own GitHub account and then clone it to your local machine.
+1. Checkout a new branch.
+1. Make some changes to your leetcode repository, then push the changes to your remote GitHub repository.
+1. Create a pull request with your changes!
+1. See [CONTRIBUTING](https://github.com/doocs/.github/blob/main/CONTRIBUTING.md) or [GitHub Help](https://help.github.com/en) for more details.
+
+<p align="center">
+  <a href="https://github.com/doocs/leetcode"><img src="https://cdn-doocs.oss-cn-shenzhen.aliyuncs.com/gh/doocs/leetcode@main/images/how-to-contribute.svg" alt="how-to-contribute"></a>
+</p>
+
+[![Open in GitHub Codespaces](https://github.com/codespaces/badge.svg)](https://github.com/codespaces/new?hide_repo_select=true&ref=main&repo=149001365&machine=basicLinux32gb&location=EastUs)

docs/index.md

@@ -1 +1,59 @@
-# LeetCode Wiki
+<p align="center">
+  <a href="https://github.com/doocs/leetcode"><img src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/images/leetcode-doocs.png" alt="LeetCode-GitHub-Doocs"></a>
+</p>
+
+<p align="center">
+  <a href="https://doocs.github.io/#/?id=how-to-join"><img src="https://img.shields.io/badge/organization-join%20us-4051B5?style=flat-square" alt="open-source-organization"></a>
+  <a href="https://github.com/doocs/leetcode"><img src="https://img.shields.io/badge/langs-Python%20%7C%20Java%20%7C%20C++%20%7C%20Go%20%7C%20TypeScript%20%7C%20Rust%20%7C%20...-red?style=flat-square&color=4051B5" alt="languages"></a>
+  <a href="https://github.com/doocs/leetcode/blob/main/LICENSE"><img src="https://img.shields.io/github/license/doocs/leetcode?color=4051B5&style=flat-square" alt="LICENSE"></a><br>
+  <a href="https://opencollective.com/doocs-leetcode/backers/badge.svg" alt="backers on Open Collective"><img src="https://img.shields.io/opencollective/backers/doocs-leetcode?color=4051B5&style=flat-square&logo=open%20collective&logoColor=ffffff" /></a>
+  <a href="https://github.com/doocs/leetcode/stargazers"><img src="https://img.shields.io/github/stars/doocs/leetcode?color=4051B5&logo=github&style=flat-square" alt="stars"></a>
+  <a href="https://github.com/doocs/leetcode/network/members"><img src="https://img.shields.io/github/forks/doocs/leetcode?color=4051B5&logo=github&style=flat-square" alt="forks"></a>
+  <a href="https://opencollective.com/doocs-leetcode/sponsors/badge.svg" alt="Sponsors on Open Collective"><img src="https://img.shields.io/opencollective/sponsors/doocs-leetcode?color=4051B5&style=flat-square&logo=open%20collective&logoColor=ffffff" /></a>
+</p>
+
+## 介绍
+
+欢迎来到 LeetCode Wiki！
+
+本项目包含 LeetCode、《剑指 Offer（第 2 版）》、《剑指 Offer（专项突击版）》、《程序员面试金典（第 6 版）》等题目的相关题解。所有题解均由多种编程语言实现，包括但不限于：Java、Python、C++、Go、TypeScript、Rust。我们正在全力更新，欢迎 Star 🌟 关注[本项目](https://github.com/doocs/leetcode)，获取项目最新动态。
+
+## Stars 趋势
+
+<!-- 使用 https://starchart.cc/ 自动刷新 stars 数据，若有问题，可以使用 GitHub Action: starcharts.yml -->
+<!-- <a href="https://github.com/doocs/leetcode/stargazers" target="_blank"><img src="https://starchart.cc/doocs/leetcode.svg" alt="Stargazers over time" /></a> -->
+
+<!-- [![Star History Chart](https://api.star-history.com/svg?repos=doocs/leetcode&type=Date)](https://star-history.com/#doocs/leetcode) -->
+
+<a href="https://github.com/doocs/leetcode/stargazers" target="_blank"><img src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/images/starcharts.svg" alt="Stargazers over time" /></a>
+
+## 赞助者
+
+感谢以下个人、组织对本项目的支持和赞助！
+
+<a href="https://opencollective.com/doocs-leetcode/backers.svg?width=890" target="_blank"><img src="https://opencollective.com/doocs-leetcode/backers.svg?width=890"></a>
+
+<a href="https://opencollective.com/doocs-leetcode/sponsors.svg?width=890" target="_blank"><img src="https://opencollective.com/doocs-leetcode/sponsors.svg?width=890"></a>
+
+> "_You help the developer community practice for interviews, and there is nothing better we could ask for._" -- [Alan Yessenbayev](https://opencollective.com/alan-yessenbayev)
+
+## 推荐者
+
+知名互联网科技博主 [@爱可可-爱生活](https://weibo.com/fly51fly) 微博推荐。
+
+<a href="https://weibo.com/fly51fly" target="_blank"><img src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/images/recommender-fly51fly.png"></a>
+
+## 版权
+
+本项目著作权归 [GitHub 开源社区 Doocs](https://github.com/doocs) 所有，商业转载请联系 @yanglbme 获得授权，非商业转载请注明出处。
+
+## 联系我们
+
+欢迎各位小伙伴们添加 @yanglbme 的个人微信（微信号：YLB0109），备注 「**leetcode**」。后续我们会创建算法、技术相关的交流群，大家一起交流学习，分享经验，共同进步。
+
+| <img src="https://cdn-doocs.oss-cn-shenzhen.aliyuncs.com/gh/doocs/images/qrcode-for-yanglbme.png" width="260px" align="left"/> |
+| ------------------------------------------------------------------------------------------------------------------------------ |
+
+## 许可证
+
+<a rel="license" href="http://creativecommons.org/licenses/by-sa/4.0/">知识共享 版权归属-相同方式共享 4.0 国际 公共许可证</a>

docs/intro/contribution.md

@@ -0,0 +1,23 @@
+## 贡献者
+
+感谢以下所有朋友对本项目的贡献！
+
+<a href="https://github.com/doocs/leetcode/graphs/contributors" target="_blank"><img src="https://contrib.rocks/image?repo=doocs/leetcode&max=500" /></a>
+
+## 加入我们
+
+刷编程题的最大好处就是可以锻炼解决问题的思维能力。相信我，「如何去思考」​ 本身也是一项需要不断学习和练习的技能。非常感谢前微软工程师、现蚂蚁金服技术专家 [@kfstorm](https://github.com/kfstorm) 贡献了本项目的所有 [C# 题解](https://github.com/doocs/leetcode/pull/245)。
+
+如果你对本项目感兴趣，并且希望加入我们刷题小分队，欢迎随时提交 [PR](https://github.com/doocs/leetcode/pulls)。请参考如下步骤：
+
+1. 将本项目 fork 到你的个人 GitHub 帐户，然后 clone 到你的本地机器；
+1. 进入 leetcode 目录，切换到一个新的分支；
+1. 对项目做出一些变更，然后使用 git add、commit、push 等命令将你的本地变更提交到你的远程 GitHub 仓库；
+1. 将你的变更以 PR 的形式提交过来，项目的维护人员会在第一时间对你的变更进行 review！
+1. 你也可以参考帮助文档 https://help.github.com/cn 了解更多细节。
+
+<p align="center">
+  <a href="https://github.com/doocs/leetcode"><img src="https://cdn-doocs.oss-cn-shenzhen.aliyuncs.com/gh/doocs/leetcode@main/images/how-to-contribute.svg" alt="how-to-contribute"></a>
+</p>
+
+[![Open in GitHub Codespaces](https://github.com/codespaces/badge.svg)](https://github.com/codespaces/new?hide_repo_select=true&ref=main&repo=149001365&machine=basicLinux32gb&location=SoutheastAsia)

main.py

@@ -176,9 +176,29 @@ def get_paths(dirs: str, m: int):
 if "nav:" in en_config:
     en_config = en_config[: en_config.find("nav:")]
 
+"""
+nav:
+  - 首页:
+    - 首页: index.md
+    - 参与贡献: intro/contribution.md
+  - LeetCode 全解:
+
+nav:
+  - Home:
+    - Home: index.md
+    - Contribution: intro/contribution.md
+  - LeetCode:
+"""
+
 config += "\nnav:\n"
 en_config += "\nnav:\n"
+config += "  - 首页:\n"
+config += "    - 首页: index.md\n"
+config += "    - 参与贡献: intro/contribution.md\n"
 config += "  - LeetCode 全解:\n"
+en_config += "  - Home:\n"
+en_config += "    - Home: index.md\n"
+en_config += "    - Contribution: intro/contribution.md\n"
 en_config += "  - LeetCode:\n"
 config += "\n".join(navdata_cn["solution"])
 en_config += "\n".join(navdata_en["solution"])

mkdocs-en.yml

@@ -9,7 +9,11 @@ theme:
     text: Roboto
     code: Roboto Mono
 
+
 nav:
+  - Home:
+    - Home: index.md
+    - Contribution: intro/contribution.md
   - LeetCode:
     - 1. Two Sum: lc/1.md
     - 2. Add Two Numbers: lc/2.md
@@ -3019,7 +3023,7 @@ nav:
     - 3006. Find Beautiful Indices in the Given Array I: lc/3006.md
     - 3007. Maximum Number That Sum of the Prices Is Less Than or Equal to K: lc/3007.md
     - 3008. Find Beautiful Indices in the Given Array II: lc/3008.md
-  - Cracking the Coding Interview, 6th Edition:
+  - Cracking the Coding Interview:
     - 1.1. Is Unique: lcci/1.1.md
     - 1.2. Check Permutation: lcci/1.2.md
     - 1.3. String to URL: lcci/1.3.md

mkdocs.yml

@@ -34,7 +34,7 @@ theme:
     - search.share
     - search.suggest
     - toc.follow
-    # - toc.integrate
+    - toc.integrate
   icon:
     repo: fontawesome/brands/github
   language: zh
@@ -91,9 +91,11 @@ extra:
       link: /leetcode/
       lang: zh
 
-
 nav:
-  - LeetCode:
+  - 首页:
+    - 首页: index.md
+    - 参与贡献: intro/contribution.md
+  - LeetCode 全解:
     - 1. 两数之和: lc/1.md
     - 2. 两数相加: lc/2.md
     - 3. 无重复字符的最长子串: lc/3.md
@@ -3102,7 +3104,7 @@ nav:
     - 3006. 找出数组中的美丽下标 I: lc/3006.md
     - 3007. 价值和小于等于 K 的最大数字: lc/3007.md
     - 3008. 找出数组中的美丽下标 II: lc/3008.md
-  - 剑指 Offer（第 2 版）:
+  - 剑指 Offer:
     - 3. 数组中重复的数字: lcof/3.md
     - 4. 二维数组中的查找: lcof/4.md
     - 5. 替换空格: lcof/5.md
@@ -3178,7 +3180,7 @@ nav:
     - 67. 把字符串转换成整数: lcof/67.md
     - 68.1. 二叉搜索树的最近公共祖先: lcof/68.1.md
     - 68.2. 二叉树的最近公共祖先: lcof/68.2.md
-  - 剑指 Offer（专项突击版）:
+  - 剑指 Offer（专项突破）:
     - 1. 整数除法: lcof2/1.md
     - 2. 二进制加法: lcof2/2.md
     - 3. 前 n 个数字二进制中 1 的个数: lcof2/3.md
@@ -3298,7 +3300,7 @@ nav:
     - 117. 相似的字符串: lcof2/117.md
     - 118. 多余的边: lcof2/118.md
     - 119. 最长连续序列: lcof2/119.md
-  - 程序员面试金典（第 6 版）:
+  - 程序员面试金典:
     - 1.1. 判定字符是否唯一: lcci/1.1.md
     - 1.2. 判定是否互为字符重排: lcci/1.2.md
     - 1.3. URL 化: lcci/1.3.md