algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-10 20:40:39 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update 0225.用队列实现栈.md

Browse Source
This commit is contained in:
lfeng
2021-10-08 10:12:08 +08:00
committed by GitHub
parent 9badd38a38
commit ff7c57a7d0
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/0225.用队列实现栈.md
View File

@ -112,7 +112,7 @@ public:
# 优化 # 优化
其实这道题目就是用一个队里就够了。 其实这道题目就是用一个队列就够了。
**一个队列在模拟栈弹出元素的时候只要将队列头部的元素（除了最后一个元素外） 重新添加到队列尾部，此时在去弹出元素就是栈的顺序了。** **一个队列在模拟栈弹出元素的时候只要将队列头部的元素（除了最后一个元素外） 重新添加到队列尾部，此时在去弹出元素就是栈的顺序了。**