• We have BFS and DFS images in both Breadth First Traversal and Depth First Traversal. We should have illustrations in the respective sections.

使用队列实现栈的下列操作：

push(x) -- 元素 x 入栈
pop() -- 移除栈顶元素
top() -- 获取栈顶元素
empty() -- 返回栈是否为空
注意:

你只能使用队列的基本操作-- 也就是 push to back, peek/pop from front, size, 和 is empty 这些操作是合法的。
你所使用的语言也许不支持队列。 你可以使用 list 或者 deque（双端队列）来模拟一个队列 , 只要是标准的队列操作即可。
你可以假设所有操作都是有效的（例如, 对一个空的栈不会调用 pop 或者 top 操作）。

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/implement-stack-using-queues
著作权归领扣网络所有。商业转载请联系官方授权

我将开始翻译如下文章（点击可查看目标文章）：

高频面试系列/koko偷香蕉.md

我准备将它翻译成：英文

**预计 7 天内

🚀 Feature Proposal

Add hide solved problems to VS Code command.

Motivation

Hiding solved problems is convenient for writing, but sometimes I need to review the problems I sovled before.

Add new sections by GitbookIO editor is quite simple, but sometimes you may forget to add sections in SUMMARY.md.

It is easy to parse the title of source .md files and add it to the appropriate chapter position. I will implement this feature with Python.

A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null.

Return a deep copy of the list.

Example 1:

Input:
{"$id":"1","next":{"$id":"2","next":null,"random":{"$ref":