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

translate 数据结构系列/单调栈 #90

Merged
merged 4 commits into from
Mar 1, 2020

Conversation

miaoxiaozui2017
Copy link
Contributor

翻译 数据结构系列/单调栈

翻译初稿,添加原文地址链接。
调整格式,部分加粗。部分措辞修改。
Copy link
Owner

@labuladong labuladong left a comment

Choose a reason for hiding this comment

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

修改以上两个小问题即可合并

This problem can be thought abstractly: think of the elements in the array as people standing side by side, and the size of the elements as the height of an adult. These people stand in line before you. How to find the `Next Greater Number` of element `"2"`? Very simply, if you can see the element `"2"`, then the first person you can see behind him is the `Next Greater Number` of `"2"`. Because the element smaller than `"2"` is not tall enough and it is blocked by `"2"`,the first one not being blocked is the answer.


![ink-image](../pictures/%E5%8D%95%E8%B0%83%E6%A0%88/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.

Suggested change
![ink-image](../pictures/%E5%8D%95%E8%B0%83%E6%A0%88/1.png)
![ink-image](../pictures/%E5%8D%95%E8%B0%83%E6%A0%88/1.png)

这串 % 字符是中文转码,请将对应文件夹改名为英文,下面的图片链接同样修改即可

@miaoxiaozui2017 miaoxiaozui2017 changed the title patch 1 translate 数据结构系列/单调栈 Mar 1, 2020
Co-Authored-By: labuladong <labuladong@gmail.com>
@labuladong labuladong merged commit 2658156 into labuladong:english Mar 1, 2020
@labuladong labuladong added the finish 翻译完成 label Mar 1, 2020
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