Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

[pull] master from youngyangyang04:master #109

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

Merged
pull merged 7 commits into AlgorithmAndLeetCode:master from youngyangyang04:master
Oct 11, 2022

Conversation

Copy link

@pull pull bot commented Oct 11, 2022
edited
Loading

See Commits and Changes for more details.


Created by pull[bot]

Can you help keep this open source service alive? 💖 Please sponsor : )

Flow-sandyu and others added 7 commits October 2, 2022 14:24
159 行 StringBuffer str 改成 String s
并把后续的 str 都换成 s
不然原答案是不能AC 的
时间复杂度 O(n)
参考卡哥 c++ 代码的实现:先移除多余空格,再将整个字符串反转,最后把单词逐个反转
时间复杂度 O(n)
参考卡哥 c++ 代码的实现:先移除多余空格,再将整个字符串反转,最后把单词逐个反转
有别于解法一 :没有用 StringBuilder 实现,而是对 String 的 char[] 数组操作来实现以上三个步骤
解法二:空间复杂度:O(1)。用原始数组来进行反转操作
思路:先整个字符串反转,再反转前面的,最后反转后面 n 个
优化,使用一个 Queue 实现
对比 『使用一个 Deque 实现』 的解法,我把移动元素的代码放到 push 方法里,代码看起来更简洁
Update:增加三道题的解法,修改两处错误
@pull pull bot added the ⤵️ pull label Oct 11, 2022
@pull pull bot merged commit d93cd62 into AlgorithmAndLeetCode:master Oct 11, 2022
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Reviewers
No reviews
Assignees
No one assigned
Projects
None yet
Milestone
No milestone
Development

Successfully merging this pull request may close these issues.

AltStyle によって変換されたページ (->オリジナル) /