mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 19:53:12 +08:00
28 lines
1.1 KiB
HTML
28 lines
1.1 KiB
HTML
<p>Write a program to sort a stack such that the smallest items are on the top. You can use an additional temporary stack, but you may not copy the elements into any other data structure (such as an array). The stack supports the following operations: <code>push</code>, <code>pop</code>, <code>peek</code>, and <code>isEmpty</code>. When the stack is empty, <code>peek</code> should return -1.</p>
|
|
|
|
|
|
|
|
<p><strong>Example1:</strong></p>
|
|
|
|
|
|
|
|
<pre>
|
|
|
|
<strong> Input</strong>:
|
|
|
|
["SortedStack", "push", "push", "peek", "pop", "peek"]
|
|
|
|
[[], [1], [2], [], [], []]
|
|
|
|
<strong> Output</strong>:
|
|
|
|
[null,null,null,1,null,2]
|
|
|
|
</pre>
|
|
|
|
|
|
|
|
<p><strong>Example2:</strong></p>
|
|
|
|
|
|
|
|
<pre>
|
|
|
|
<strong> Input</strong>:
|
|
|
|
["SortedStack", "pop", "pop", "push", "pop", "isEmpty"]
|
|
|
|
[[], [], [], [1], [], []]
|
|
|
|
<strong> Output</strong>:
|
|
|
|
[null,null,null,null,null,true]
|
|
|
|
</pre>
|
|
|
|
|
|
|
|
<p><strong>Note:</strong></p>
|
|
|
|
|
|
|
|
<ol>
|
|
|
|
<li>The total number of elements in the stack is within the range [0, 5000].</li>
|
|
|
|
</ol>
|
|
|