标签：enc put bool int empty c++ ack tco value
Given two sequences pushed and popped with distinct values, return true if and only if this could have been the result of a sequence of push and pop operations on an initially empty stack.
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.
Note:
0 <= pushed.length == popped.length <= 10000 <= pushed[i], popped[i] < 1000pushed is a permutation of popped.pushed and popped have distinct values.栈
C++代码：
class Solution { public: bool validateStackSequences(vector<int>& pushed, vector<int>& popped) { stack<int> s; int len = pushed.size(); int j = 0; for(int n : pushed){ s.push(n); while(!s.empty() && j < len && s.top() == popped[j]){ s.pop(); j++; } } return j == len; } };
（栈）leetcode 946. Validate Stack Sequences
标签：enc put bool int empty c++ ack tco value
原文地址：https://www.cnblogs.com/Weixu-Liu/p/10582618.html
