LeetCode 946. Validate Stack Sequences

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:

1. 0 <= pushed.length == popped.length <= 1000
2. 0 <= pushed[i], popped[i] < 1000
3. pushed is a permutation of popped.
4. pushed and popped have distinct values.

   ---

   和火车进站问题类似，简单栈使用。

   ---

   class Solution {
   public:
       bool validateStackSequences(vector<int>& pushed, vector<int>& popped) {
           stack<int> s;
           if(pushed.size()==0&&popped.size()==0)
               return true;
           if(pushed.size()==0||popped.size()==0)
               return false;
           s.push(pushed[0]);
           int i=1,j=0;
           while(true)
           {
               if(s.empty())
               {
                   if(i<pushed.size())
                   {
                       s.push(pushed[i]);
                       ++i;
                   }
                   else
                       return false;
               }
               if(s.top()==popped[j])
               {
                   s.pop();
                   ++j;
               }
               else
               {
                   if(i<pushed.size())
                   {
                       s.push(pushed[i]);
                       ++i;
                   }
                   else
                       return false;
               }
               if(j==popped.size())
                   return true;
               //cout<<i<<"   "<<j<<endl;
           }
       }
   };