翻译修正 #592
Merged
翻译修正 #592
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
原文中的which此处可省略掉，译文更通顺
|
感谢修正！ |
mibesr
pushed a commit
to mibesr/the-way-to-go_ZH_CN
that referenced
this pull request
Apr 28, 2019
* 翻译修正 A new value is put in the highest cell which is empty (contains 0), on top: this is called push. * Update 10.7.md 原文中的which此处可省略掉，译文更通顺
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
原著：
原翻译：
仅此处“非空（非零）”有误。
其余改动出于通顺阅读之目的。
To get a value from the stack, take the highest value which is not 0: this is called pop.
So we can understand why a stack is called a Last In First Out (LIFO) structure.Define a new type Stack for this datastructure.
Make 2 methods Push and Pop. Make a String() method (for debugging purposes) which shows the content of the stack as: [0:i] [1:j] [2:k] [3:l]