Class DinnerPlates
java.lang.Object
g1101_1200.s1172_dinner_plate_stacks.DinnerPlates
1172 - Dinner Plate Stacks.<p>Hard</p>
<p>You have an infinite number of stacks arranged in a row and numbered (left to right) from <code>0</code>, each of the stacks has the same maximum capacity.</p>
<p>Implement the <code>DinnerPlates</code> class:</p>
<ul>
<li><code>DinnerPlates(int capacity)</code> Initializes the object with the maximum capacity of the stacks <code>capacity</code>.</li>
<li><code>void push(int val)</code> Pushes the given integer <code>val</code> into the leftmost stack with a size less than <code>capacity</code>.</li>
<li><code>int pop()</code> Returns the value at the top of the rightmost non-empty stack and removes it from that stack, and returns <code>-1</code> if all the stacks are empty.</li>
<li><code>int popAtStack(int index)</code> Returns the value at the top of the stack with the given index <code>index</code> and removes it from that stack or returns <code>-1</code> if the stack with that given index is empty.</li>
</ul>
<p><strong>Example 1:</strong></p>
<p><strong>Input</strong></p>
<p>[“DinnerPlates”, “push”, “push”, “push”, “push”, “push”, “popAtStack”, “push”, “push”, “popAtStack”, “popAtStack”, “pop”, “pop”, “pop”, “pop”, “pop”]</p>
<p>[[2], [1], [2], [3], [4], [5], [0], [20], [21], [0], [2], [], [], [], [], []]</p>
<p><strong>Output:</strong> [null, null, null, null, null, null, 2, null, null, 20, 21, 5, 4, 3, 1, -1]</p>
<p><strong>Explanation:</strong></p>
<pre><code> DinnerPlates D = DinnerPlates(2); // Initialize with capacity = 2
D.push(1);
D.push(2);
D.push(3);
D.push(4);
D.push(5); // The stacks are now: 2 4
1 3 5
\ufe48 \ufe48 \ufe48
D.popAtStack(0); // Returns 2. The stacks are now: 4
1 3 5
\ufe48 \ufe48 \ufe48
D.push(20); // The stacks are now: 20 4
1 3 5
\ufe48 \ufe48 \ufe48
D.push(21); // The stacks are now: 20 4 21
1 3 5
\ufe48 \ufe48 \ufe48
D.popAtStack(0); // Returns 20. The stacks are now: 4 21
1 3 5
\ufe48 \ufe48 \ufe48
D.popAtStack(2); // Returns 21. The stacks are now: 4
1 3 5
\ufe48 \ufe48 \ufe48
D.pop() // Returns 5. The stacks are now: 4
1 3
\ufe48 \ufe48
D.pop() // Returns 4. The stacks are now: 1 3
\ufe48 \ufe48
D.pop() // Returns 3. The stacks are now: 1
\ufe48
D.pop() // Returns 1. There are no stacks.
D.pop() // Returns -1. There are still no stacks.
</code></pre>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>1 <= capacity <= 2 * 10<sup>4</sup></code></li>
<li><code>1 <= val <= 2 * 10<sup>4</sup></code></li>
<li><code>0 <= index <= 10<sup>5</sup></code></li>
<li>At most <code>2 * 10<sup>5</sup></code> calls will be made to <code>push</code>, <code>pop</code>, and <code>popAtStack</code>.</li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
DinnerPlates
public DinnerPlates(int capacity)
-
-
Method Details
-
push
public void push(int val) -
pop
public int pop() -
popAtStack
public int popAtStack(int index)
-