validate-stack-sequences

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

cangjie

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

Given two integer arrays <code>pushed</code> and <code>popped</code> each with distinct values, return <code>true</code> if this could have been the result of a sequence of push and pop operations on an initially empty stack, or <code>false</code> otherwise.

&nbsp;
Example 1:

<pre>
Input: pushed = [1,2,3,4,5], popped = [4,5,3,2,1]
Output: true
Explanation: We might do the following sequence:
push(1), push(2), push(3), push(4),
pop() -&gt; 4,
push(5),
pop() -&gt; 5, pop() -&gt; 3, pop() -&gt; 2, pop() -&gt; 1
</pre>

Example 2:

<pre>
Input: pushed = [1,2,3,4,5], popped = [4,3,5,1,2]
Output: false
Explanation: 1 cannot be popped before 2.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= pushed.length &lt;= 1000</code></li>
	<li><code>0 &lt;= pushed[i] &lt;= 1000</code></li>
	<li>All the elements of <code>pushed</code> are unique.</li>
	<li><code>popped.length == pushed.length</code></li>
	<li><code>popped</code> is a permutation of <code>pushed</code>.</li>
</ul>

&#31532; 112 &#22330;&#21608;&#36187;

weekly-contest-112

validateStackSequences

&#39640;&#32423;&#19987;&#23478;

Validate Stack Sequences

Stack

Array

Simulation

&#32473;&#23450;&nbsp;<code>pushed</code>&nbsp;&#21644;&nbsp;<code>popped</code>&nbsp;&#20004;&#20010;&#24207;&#21015;&#65292;&#27599;&#20010;&#24207;&#21015;&#20013;&#30340; &#20540;&#37117;&#19981;&#37325;&#22797;&#65292;&#21482;&#26377;&#24403;&#23427;&#20204;&#21487;&#33021;&#26159;&#22312;&#26368;&#21021;&#31354;&#26632;&#19978;&#36827;&#34892;&#30340;&#25512;&#20837; push &#21644;&#24377;&#20986; pop &#25805;&#20316;&#24207;&#21015;&#30340;&#32467;&#26524;&#26102;&#65292;&#36820;&#22238; <code>true</code>&#65307;&#21542;&#21017;&#65292;&#36820;&#22238; <code>false</code>&nbsp;&#12290;

&nbsp;

&#31034;&#20363; 1&#65306;

<pre>
&#36755;&#20837;&#65306;pushed = [1,2,3,4,5], popped = [4,5,3,2,1]
&#36755;&#20986;&#65306;true
&#35299;&#37322;&#65306;&#25105;&#20204;&#21487;&#20197;&#25353;&#20197;&#19979;&#39034;&#24207;&#25191;&#34892;&#65306;
push(1), push(2), push(3), push(4), pop() -&gt; 4,
push(5), pop() -&gt; 5, pop() -&gt; 3, pop() -&gt; 2, pop() -&gt; 1
</pre>

&#31034;&#20363; 2&#65306;

<pre>
&#36755;&#20837;&#65306;pushed = [1,2,3,4,5], popped = [4,3,5,1,2]
&#36755;&#20986;&#65306;false
&#35299;&#37322;&#65306;1 &#19981;&#33021;&#22312; 2 &#20043;&#21069;&#24377;&#20986;&#12290;
</pre>

&nbsp;

&#25552;&#31034;&#65306;

<ul>
	<li><code>1 &lt;= pushed.length &lt;= 1000</code></li>
	<li><code>0 &lt;= pushed[i] &lt;= 1000</code></li>
	<li><code>pushed</code> &#30340;&#25152;&#26377;&#20803;&#32032; &#20114;&#19981;&#30456;&#21516;</li>
	<li><code>popped.length == pushed.length</code></li>
	<li><code>popped</code> &#26159; <code>pushed</code> &#30340;&#19968;&#20010;&#25490;&#21015;</li>
</ul>

Sunbelt Computer Software

PL/B Language Development and Support