logo

Imagine a normal queue (push, peek, pop, and empty) but only need two stacks to implement it. The MyQueue class must support all queue functions (push, peek, pop, and empty). The push() method pushes element x to the front of the queue.

Imagine a normal queue (push, peek, pop, and empty) but only need two stacks to implement it. The MyQueue class must support all queue functions (push, peek, pop, and empty). The push() method pushes element x to the front of the queue.

题目类型: 技术面试题

这是一道技术面试题,常见于澳洲IT公司面试中。

难度: easy

标签: interviewbit, maq, company-specific

目标公司: MAQ Software

参考答案摘要

The pop() method returns the front element. The peek() method checks to see if the queue is empty. If it is, the empty() method returns true. If not, the method returns false. The queue is empty if it...

本题提供 STAR 原则详细解答和技术解析,登录匠人学院学习中心即可查看完整答案。

← 返回面试题库

Imagine a normal queue (push, peek, pop, and empty) but only need two stacks to implement it. The MyQueue class must support all queue functions (push, peek, pop, and empty). The push() method pushes element x to the front of the queue.

Easy

想查看完整答案?

登录匠人学院学习中心,获取 STAR 格式回答和详细技术解析

前往学习中心查看答案