-
-
Notifications
You must be signed in to change notification settings - Fork 9k
add solution 0952 #132
New issue
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
add solution 0952 #132
Conversation
明天上午我仔细看一下哈~现在关电脑睡觉了。 |
@biubiubiubiubiubiubiu 感谢提交,我刚刚仔细看了你的 commit 内容,代码写得很规范,很棒。但是我在
你可以参考 @Mrtj2016 这位老哥的提交,比如这个,你可以直接 copy 一份,然后每一题对应的 标题/描述/示例/解法 做个替换。其实这位老哥一开始就做的很规范,我很快就把他加入本项目的 如果你认可我提出的这些小建议,可以修改之后再提交过来~我再进行 Review。 😄 期待你也能加入项目的 Collaborators 中。 |
} | ||
``` | ||
|
||
但是这个代码其实会超时,因为中间的遍历逻辑会耗费很长的时间,时间复杂度为 O(n^2)。因此我们需要更快一点的解法。 |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
时间复杂度,请写为 O(n²)
,更直观哈。
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
你好,非常感谢你的意见,我已经修改了新的一版上去,还有什么问题也烦请指出。谢谢啦
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
@biubiubiubiubiubiubiu 好的,我已经看到你的修改了。之后如果有要修改的地方,争取所有地方都修改完,检查 okay 之后再 commit,就不要为一道题提交了 8 次啦 😅。
@biubiubiubiubiubiubiu 😁期待你做得越来越好~ |
新手上路,请多指教~