30 lines
1.2 KiB
Markdown
30 lines
1.2 KiB
Markdown
|
<p>给定 <code>pushed</code> 和 <code>popped</code> 两个序列，每个序列中的 <strong>值都不重复</strong>，只有当它们可能是在最初空栈上进行的推入 push 和弹出 pop 操作序列的结果时，返回 <code>true</code>；否则，返回 <code>false</code> 。</p>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>示例 1：</strong></p>
|
|||
|
|
|
|||
|
|
<pre><strong>输入：</strong>pushed = [1,2,3,4,5], popped = [4,5,3,2,1]
|
|||
|
|
<strong>输出：</strong>true
|
|||
|
|
<strong>解释：</strong>我们可以按以下顺序执行：
|
|||
|
|
push(1), push(2), push(3), push(4), pop() -> 4,
|
|||
|
|
push(5), pop() -> 5, pop() -> 3, pop() -> 2, pop() -> 1
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 2：</strong></p>
|
|||
|
|
|
|||
|
|
<pre><strong>输入：</strong>pushed = [1,2,3,4,5], popped = [4,3,5,1,2]
|
|||
|
|
<strong>输出：</strong>false
|
|||
|
|
<strong>解释：</strong>1 不能在 2 之前弹出。
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>提示：</strong></p>
|
|||
|
|
|
|||
|
|
<ol>
|
|||
|
|
<li><code>0 <= pushed.length == popped.length <= 1000</code></li>
|
|||
|
|
<li><code>0 <= pushed[i], popped[i] < 1000</code></li>
|
|||
|
|
<li><code>pushed</code> 是 <code>popped</code> 的排列。</li>
|
|||
|
|
</ol>
|
|||
|
|
<div><div>Related Topics</div><div><li>栈</li></div></div>\n<div><li>👍 175</li><li>👎 0</li></div>
|