mirror of
https://github.com/labuladong/fucking-algorithm.git
synced 2025-07-05 03:36:39 +08:00
Add translator
This commit is contained in:
@ -1,5 +1,9 @@
|
||||
# Implement Queue using Stacks |Implement Stack using Queues
|
||||
|
||||
**Author**:[labuladong](https://github.com/labuladong)
|
||||
|
||||
**Translator**:[walsvid](https://github.com/walsvid)
|
||||
|
||||
Queue is a FIFO (first-in-first-out) strategy data structure, while Stack is a FILO (first-in-last-out) data structure. The visual description of these data structures is shown in the figure:
|
||||
|
||||

|
||||
@ -200,6 +204,4 @@ After moving elements from stack `s1` to `s2`, the elements become the FIFO orde
|
||||
|
||||
I hope this article is helpful to you.
|
||||
|
||||
"Stick to original high-quality articles, and work hard to make algorithmic problems clear." Welcome to follow my WeChat public account **labuladong** for the latest articles:
|
||||
|
||||

|
||||
"Stick to original high-quality articles, and work hard to make algorithmic problems clear."
|
Reference in New Issue
Block a user