-
Notifications
You must be signed in to change notification settings - Fork 23.3k
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
English 翻译数据结构系列/单调队列.md #61
Conversation
data_structure/Monotonic queue.md
Outdated
} | ||
``` | ||
|
||
The pop () API deletes element n at the head of the team, which is also very easy to write: |
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.
队列是 queue 吧,team 是什么鬼。。。下面同理都要改,team 会让人很迷惑。
|
||
See a LeetCode title,difficulty is hard: | ||
|
||
 |
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.
将 pictures 中的相关文件夹名称也改成英文。另外这个题目可以在英文版 LeetCode 上找到,在这里 https://leetcode.com/problems/sliding-window-maximum/ ,你可以重新截图题目替换此图片。
} | ||
``` | ||
|
||
 |
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.
图片中的中文请改成英文,或者在中文底下加上英文单词也行,底下的图片同理。
data_structure/Monotonic queue.md
Outdated
} | ||
``` | ||
|
||
**3, Algorithm complexity analysis** |
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.
请把 3 和 4 也改成三级标题 ### 把,和之前的统一。
data_structure/Monotonic queue.md
Outdated
Hurry up and get LeetCode's Question 239 ~ | ||
|
||
Stick to original high-quality articles, and work hard to make algorithmic problems clear. Welcome to follow my public account labuladong for the latest articles: | ||
|
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.
The complexity of the push operation alone is not O (1), but the overall complexity of the algorithm is still O (N) linear time. To think of it this way, each element in nums is pushed_back and pop_back at most once, without any redundant operations, so the overall complexity is still O (N). | ||
|
||
The space complexity is very simple, which is the size of the window O (k). | ||
|
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.
有的用词不是很准确,可以尝试把你的翻译成果通过语法检查工具检查一下,比如粘贴到 Word 中看看有没有基本语法错误。
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.
好的
请对以上几个小问题进行修改,即可进行分支合并 |
好的,今明2天会来搞好的 |
感谢你的出色工作,已合并~ |
谢谢,第一次操作不太会,不足之处望见谅 |
翻译了本文和一个图片里的题目翻译了,这样可以吗?