其他分享
首页 > 其他分享> > 剑指 Offer 09. 用两个栈实现队列

剑指 Offer 09. 用两个栈实现队列

作者:互联网

用两个栈实现一个队列。队列的声明如下,请实现它的两个函数 appendTail 和 deleteHead ,分别完成在队列尾部插入整数和在队列头部删除整数的功能。(若队列中没有元素,deleteHead 操作返回 -1 )

 

示例 1:

输入:
["CQueue","appendTail","deleteHead","deleteHead"]
[[],[3],[],[]]
输出:[null,null,3,-1]
示例 2:

输入:
["CQueue","deleteHead","appendTail","appendTail","deleteHead","deleteHead"]
[[],[],[5],[2],[],[]]
输出:[null,-1,null,null,5,2]
提示:

1 <= values <= 10000
最多会对 appendTail、deleteHead 进行 10000 次调用

 

标签:deleteHead,appendTail,Offer,队列,CQueue,09,示例,null
来源: https://www.cnblogs.com/cberblog/p/15511497.html