We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
https://github.com/hollischuang/algorithm/blob/master/contribute.md
各位网友好,在向本项目提交您的答案详解时,请阅读以下内容
0. 从题目列表或者leetCode题库选择题目
https://github.com/hollischuang/algorithm/blob/master/daily.md
https://leetcode-cn.com/problemset/all/
1. 为运行成功的代码写出详细注释
精简版答案包括: 1) 能够在leetCode上成功提交的代码 2) 代码详细注释 3) 参考或引用的链接
精简版答案示例下载地址:
https://github.com/hollischuang/algorithm/blob/master/leetcode/sample/concise.md
详尽版答案包括: 1) 能够在leetCode上成功提交的代码 2) 代码详细注释 3) 复杂度分析:包括时间复杂度和空间复杂度 4) 方法和思路概述 5) 参考或引用的链接
详尽版示例下载地址:
https://github.com/hollischuang/algorithm/blob/master/leetcode/sample/full.md
不强制原创,如果提交的答案有借鉴、转载、翻译, 请务必注明引用出处
2. 找到题目所在目录,新建md文件并提交,命名规则 "英文或拼音昵称.md"
/Interview/algorithm/leetcode/141-LinkedListCycle 如果项目里还没有该题的文件夹,请按照驼峰式命名法新建"题号-题目名称.md",题号小于百位数请加0 比如题号是24的swap-nodes-in-pairs,命名后如下 /Interview/algorithm/leetcode/024-SwapNodesInPairs
比如你的昵称叫offical, 文件就命名为 official.md
/Interview/algorithm/leetcode/141-LinkedListCycle/offical.md
The text was updated successfully, but these errors were encountered:
No branches or pull requests
https://github.com/hollischuang/algorithm/blob/master/contribute.md
提交答案步骤
0. 从题目列表或者leetCode题库选择题目
https://github.com/hollischuang/algorithm/blob/master/daily.md
https://leetcode-cn.com/problemset/all/
1. 为运行成功的代码写出详细注释
2. 找到题目所在目录,新建md文件并提交,命名规则 "英文或拼音昵称.md"
The text was updated successfully, but these errors were encountered: