1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-01-10 18:48:13 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
leetcode-problemset/leetcode-cn/problem (Chinese)/设计前中后队列 [design-front-middle-back-queue].html
2022-03-29 12:43:11 +08:00

54 lines
2.7 KiB
HTML
Raw Blame History

This file contains invisible Unicode characters

This file contains invisible Unicode characters that are indistinguishable to humans but may be processed differently by a computer. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

<p>请你设计一个队列,支持在前,中,后三个位置的 <code>push</code> 和 <code>pop</code> 操作。</p>
<p>请你完成 <code>FrontMiddleBack</code> 类:</p>
<ul>
<li><code>FrontMiddleBack()</code> 初始化队列。</li>
<li><code>void pushFront(int val)</code> 将 <code>val</code> 添加到队列的 <strong>最前面</strong> 。</li>
<li><code>void pushMiddle(int val)</code> 将 <code>val</code> 添加到队列的 <strong>正中间</strong> 。</li>
<li><code>void pushBack(int val)</code> 将 <code>val</code> 添加到队里的 <strong>最后面</strong> 。</li>
<li><code>int popFront()</code> 将 <strong>最前面</strong> 的元素从队列中删除并返回值,如果删除之前队列为空,那么返回 <code>-1</code> 。</li>
<li><code>int popMiddle()</code><b>正中间</b> 的元素从队列中删除并返回值,如果删除之前队列为空,那么返回 <code>-1</code> 。</li>
<li><code>int popBack()</code><strong>最后面</strong> 的元素从队列中删除并返回值,如果删除之前队列为空,那么返回 <code>-1</code> 。</li>
</ul>
<p>请注意当有 <strong>两个</strong> 中间位置的时候,选择靠前面的位置进行操作。比方说:</p>
<ul>
<li><code>6</code> 添加到 <code>[1, 2, 3, 4, 5]</code> 的中间位置,结果数组为 <code>[1, 2, <strong>6</strong>, 3, 4, 5]</code> 。</li>
<li>从 <code>[1, 2, <strong>3</strong>, 4, 5, 6]</code> 的中间位置弹出元素,返回 <code>3</code> ,数组变为 <code>[1, 2, 4, 5, 6]</code> 。</li>
</ul>
<p> </p>
<p><strong>示例 1</strong></p>
<pre>
<strong>输入:</strong>
["FrontMiddleBackQueue", "pushFront", "pushBack", "pushMiddle", "pushMiddle", "popFront", "popMiddle", "popMiddle", "popBack", "popFront"]
[[], [1], [2], [3], [4], [], [], [], [], []]
<strong>输出:</strong>
[null, null, null, null, null, 1, 3, 4, 2, -1]
<strong>解释:</strong>
FrontMiddleBackQueue q = new FrontMiddleBackQueue();
q.pushFront(1); // [<strong>1</strong>]
q.pushBack(2); // [1, <strong>2</strong>]
q.pushMiddle(3); // [1, <strong>3</strong>, 2]
q.pushMiddle(4); // [1, <strong>4</strong>, 3, 2]
q.popFront(); // 返回 1 -> [4, 3, 2]
q.popMiddle(); // 返回 3 -> [4, 2]
q.popMiddle(); // 返回 4 -> [2]
q.popBack(); // 返回 2 -> []
q.popFront(); // 返回 -1 -> [] (队列为空)
</pre>
<p> </p>
<p><strong>提示:</strong></p>
<ul>
<li><code>1 <= val <= 10<sup>9</sup></code></li>
<li>最多调用 <code>1000</code> 次 <code>pushFront</code> <code>pushMiddle</code> <code>pushBack</code> <code>popFront</code> <code>popMiddle</code> 和 <code>popBack</code></li>
</ul>