Skip to content
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

Merged
merged 9 commits into from
Mar 1, 2020

Conversation

warmingkkk
Copy link
Contributor

翻译了本文和一个图片里的题目翻译了,这样可以吗?

@warmingkkk warmingkkk changed the title English English 翻译数据结构系列/单调队列.md Feb 29, 2020
}
```

The pop () API deletes element n at the head of the team, which is also very easy to write:
Copy link
Owner

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:

![](../pictures/单调队列/title.png)
Copy link
Owner

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/ ,你可以重新截图题目替换此图片。

}
```

![图示](../pictures/单调队列/1.png)
Copy link
Owner

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

图片中的中文请改成英文,或者在中文底下加上英文单词也行,底下的图片同理。

}
```

**3, Algorithm complexity analysis**
Copy link
Owner

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

请把 3 和 4 也改成三级标题 ### 把,和之前的统一。

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:

Copy link
Owner

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

最后不需要放公众号的推广了,可删除二维码,在文章开头粗体添加如下内容:

Author:labuladong

Translator:你的昵称/名字,链接到你的 Github 首页或者任意你希望的链接。

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).

Copy link
Owner

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

有的用词不是很准确,可以尝试把你的翻译成果通过语法检查工具检查一下,比如粘贴到 Word 中看看有没有基本语法错误。

Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

好的

@labuladong
Copy link
Owner

请对以上几个小问题进行修改,即可进行分支合并

@labuladong labuladong self-requested a review March 1, 2020 06:36
@warmingkkk
Copy link
Contributor Author

请对以上几个小问题进行修改,即可进行分支合并

好的,今明2天会来搞好的

@labuladong
Copy link
Owner

感谢你的出色工作,已合并~

@labuladong labuladong merged commit d14f877 into labuladong:english Mar 1, 2020
@labuladong labuladong added the finish 翻译完成 label Mar 1, 2020
@warmingkkk
Copy link
Contributor Author

感谢你的出色工作,已合并〜

谢谢,第一次操作不太会,不足之处望见谅

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
finish 翻译完成
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants