Package g0901_1000.s0946_validate_stack_sequences

Class Solution

java.lang.Object

g0901_1000.s0946_validate_stack_sequences.Solution

public class Solution
extends Object

946 - Validate Stack Sequences\. Medium Given two integer arrays `pushed` and `popped` each with distinct values, return `true` _if this could have been the result of a sequence of push and pop operations on an initially empty stack, or_ `false` _otherwise._ **Example 1:** **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() -> 4, push(5), pop() -> 5, pop() -> 3, pop() -> 2, pop() -> 1 **Example 2:** **Input:** pushed = [1,2,3,4,5], popped = [4,3,5,1,2] **Output:** false **Explanation:** 1 cannot be popped before 2. **Constraints:** * `1 <= pushed.length <= 1000` * `0 <= pushed[i] <= 1000` * All the elements of `pushed` are **unique**. * `popped.length == pushed.length` * `popped` is a permutation of `pushed`.

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
boolean	validateStackSequences(int[] pushed, int[] popped)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

validateStackSequences

public boolean validateStackSequences(int[] pushed,
 int[] popped)