mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
48 lines
2.8 KiB
HTML
48 lines
2.8 KiB
HTML
|
<p>请你设计一个支持下述操作的栈。</p>
|
|||
|
|
|
|||
|
|
<p>实现自定义栈类 <code>CustomStack</code> ：</p>
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li><code>CustomStack(int maxSize)</code>：用 <code>maxSize</code> 初始化对象，<code>maxSize</code> 是栈中最多能容纳的元素数量，栈在增长到 <code>maxSize</code> 之后则不支持 <code>push</code> 操作。</li>
|
|||
|
|
<li><code>void push(int x)</code>：如果栈还未增长到 <code>maxSize</code> ，就将 <code>x</code> 添加到栈顶。</li>
|
|||
|
|
<li><code>int pop()</code>：弹出栈顶元素，并返回栈顶的值，或栈为空时返回 <strong>-1</strong> 。</li>
|
|||
|
|
<li><code>void inc(int k, int val)</code>：栈底的 <code>k</code> 个元素的值都增加 <code>val</code> 。如果栈中元素总数小于 <code>k</code> ，则栈中的所有元素都增加 <code>val</code> 。</li>
|
|||
|
|
</ul>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>示例：</strong></p>
|
|||
|
|
|
|||
|
|
<pre><strong>输入：</strong>
|
|||
|
|
["CustomStack","push","push","pop","push","push","push","increment","increment","pop","pop","pop","pop"]
|
|||
|
|
[[3],[1],[2],[],[2],[3],[4],[5,100],[2,100],[],[],[],[]]
|
|||
|
|
<strong>输出：</strong>
|
|||
|
|
[null,null,null,2,null,null,null,null,null,103,202,201,-1]
|
|||
|
|
<strong>解释：</strong>
|
|||
|
|
CustomStack customStack = new CustomStack(3); // 栈是空的 []
|
|||
|
|
customStack.push(1); // 栈变为 [1]
|
|||
|
|
customStack.push(2); // 栈变为 [1, 2]
|
|||
|
|
customStack.pop(); // 返回 2 --> 返回栈顶值 2，栈变为 [1]
|
|||
|
|
customStack.push(2); // 栈变为 [1, 2]
|
|||
|
|
customStack.push(3); // 栈变为 [1, 2, 3]
|
|||
|
|
customStack.push(4); // 栈仍然是 [1, 2, 3]，不能添加其他元素使栈大小变为 4
|
|||
|
|
customStack.increment(5, 100); // 栈变为 [101, 102, 103]
|
|||
|
|
customStack.increment(2, 100); // 栈变为 [201, 202, 103]
|
|||
|
|
customStack.pop(); // 返回 103 --> 返回栈顶值 103，栈变为 [201, 202]
|
|||
|
|
customStack.pop(); // 返回 202 --> 返回栈顶值 202，栈变为 [201]
|
|||
|
|
customStack.pop(); // 返回 201 --> 返回栈顶值 201，栈变为 []
|
|||
|
|
customStack.pop(); // 返回 -1 --> 栈为空，返回 -1
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>提示：</strong></p>
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li><code>1 <= maxSize <= 1000</code></li>
|
|||
|
|
<li><code>1 <= x <= 1000</code></li>
|
|||
|
|
<li><code>1 <= k <= 1000</code></li>
|
|||
|
|
<li><code>0 <= val <= 100</code></li>
|
|||
|
|
<li>每种方法 <code>increment</code>，<code>push</code> 以及 <code>pop</code> 分别最多调用 <code>1000</code> 次</li>
|
|||
|
|
</ul>
|