René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"DiscussionForumPosting","headline":"腾讯\u0026剑指offer09：用两个栈实现队列","articleBody":"用两个栈实现一个队列。队列的声明如下，请实现它的两个函数 `appendTail` 和 `deleteHead` ，分别完成在队列尾部插入整数和在队列头部删除整数的功能。(若队列中没有元素，`deleteHead` 操作返回 `-1` )\r\n\r\n**示例 1：**\r\n\r\n```js\r\n输入：\r\n[\"CQueue\",\"appendTail\",\"deleteHead\",\"deleteHead\"]\r\n[[],[3],[],[]]\r\n输出：[null,null,3,-1]\r\n```\r\n\r\n**示例 2：**\r\n\r\n```js\r\n输入：\r\n[\"CQueue\",\"deleteHead\",\"appendTail\",\"appendTail\",\"deleteHead\",\"deleteHead\"]\r\n[[],[],[5],[2],[],[]]\r\n输出：[null,-1,null,null,5,2]\r\n```\r\n\r\n**提示：**\r\n\r\n- `1 \u003c= values \u003c= 10000`\r\n- 最多会对 `appendTail` 、`deleteHead` 进行 `10000` 次调用\r\n\r\n[leetcode](https://leetcode-cn.com/problems/yong-liang-ge-zhan-shi-xian-dui-lie-lcof/solution/javascriptjie-leetcodeyong-liang-ge-zhan-shi-xian-/)","author":{"url":"https://github.com/sisterAn","@type":"Person","name":"sisterAn"},"datePublished":"2020-05-07T15:47:15.000Z","interactionStatistic":{"@type":"InteractionCounter","interactionType":"https://schema.org/CommentAction","userInteractionCount":3},"url":"https://github.com/34/JavaScript-Algorithms/issues/34"}