Implement Queue using Stacks

Source: Internet
Author: User

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

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.