Validate Stack Sequences
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
trueThis sequence is possible by pushing 1, 2, 3, and 4, popping 4, pushing 5, then popping 5, 3, 2, and 1.
Example 2
Input
pushed = [1,2,3,4,5], popped = [4,3,5,1,2]Output
false1 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.