mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
38 lines
1.5 KiB
HTML
38 lines
1.5 KiB
HTML
|
<p>现在图书馆有一堆图书需要放入书架，并且图书馆的书架是一种特殊的数据结构，只能按照 <strong>一定</strong> 的顺序 <strong>放入</strong> 和 <strong>拿取</strong> 书籍。</p>
|
|||
|
|
|
|||
|
|
<p>给定一个表示图书放入顺序的整数序列 <code>putIn</code>，请判断序列 <code>takeOut</code> 是否为按照正确的顺序拿取书籍的操作序列。你可以假设放入书架的所有书籍编号都不相同。</p>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>示例 1：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>putIn = [6,7,8,9,10,11], takeOut = [9,11,10,8,7,6]
|
|||
|
|
<strong>输出：</strong>true
|
|||
|
|
<strong>解释：</strong>我们可以按以下操作放入并拿取书籍：
|
|||
|
|
push(6), push(7), push(8), push(9), pop() -> 9,
|
|||
|
|
push(10), push(11),pop() -> 11,pop() -> 10, pop() -> 8, pop() -> 7, pop() -> 6
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 2：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>putIn = [6,7,8,9,10,11], takeOut = [11,9,8,10,6,7]
|
|||
|
|
<strong>输出：</strong>false
|
|||
|
|
<strong>解释：</strong>6 不能在 7 之前取出。
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>提示：</strong></p>
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li><code>0 <= putIn.length == takeOut.length <= 1000</code></li>
|
|||
|
|
<li><code>0 <= putIn[i], takeOut < 1000</code></li>
|
|||
|
|
<li><code>putIn</code> 是 <code>takeOut</code> 的排列。</li>
|
|||
|
|
</ul>
|
|||
|
|
|
|||
|
|
<p>注意：本题与主站 946 题相同：<a href="https://leetcode-cn.com/problems/validate-stack-sequences/">https://leetcode-cn.com/problems/validate-stack-sequences/</a></p>
|
|||
|
|
|
|||
|
|
<p> </p>
|