Implement Queue using Stacks

Main ideas:

Apply for two auxiliary stacks, one for in, one for out, and one for Daoteng, which is the queue before the exit becomes FIFO

1 classQueue {2stack<int>inch, out;3  Public:4     //Push element x to the back of the queue.5     voidPushintx) {6         inch. push (x);7     }8 9     //Removes the element from in front of the queue.Ten     voidPopvoid) { One CheckOut (); A          out. Pop (); -     } -  the     //Get the front element. -     intPeekvoid) { - CheckOut (); -         return  out. Top (); +          -     } +  A     //Return Whether the queue is empty. at     BOOLEmptyvoid) { -         if(inch. Empty () && out. Empty ()) -             return true; -         return false; -     } -     voidCheckOut () in     { -         if( out. Empty ()) to         { +              while(!inch. Empty ()) -             { the                  out. Push (inch. Top ()); *                 inch. Pop (); $             }Panax Notoginseng         } -     } the};

Implement Queue using Stacks