数据结构中关于栈和队列的一些例子

http://msdn.microsoft.com/en-us/library/s1b6tszt(VS.80).aspx Standard C++ Library Reference queue Members Reference Constructors queue Constructs a queue that is empty or that is a copy of a base container object. Typedefs container_type A type that provides the base container to be adapted by the queue. size_type An unsigned integer type that can represent the number of elements in a queue. value_type A type that represents the type of object stored as an element in a queue. Member Functions back Returns a reference to the last and most recently added element at the back of the queue. empty Tests if the queue is empty. front Returns a reference to the first element at the front of the queue. pop Removes an element from the front of the queue. push Adds an element to the back of the queue. size Returns the number of elements in the queue. Standard C++ Library Reference queue Functions Illustrates how to use the queue::push, queue::pop, queue::empty, queue::back, queue::front, and queue::size Standard Template Library (STL) functions in Visual C++. queue::push( ); queue::pop( ); queue::empty( ); queue::back( ); queue::front( ); queue::size( ); Description Note The class/parameter names in the prototype do not match the version in the header file. Some have been modified to improve readability. The sample shows the queue implementation using list and deque containers. Example Copy Code // queue.cpp // compile with: /EHsc // // Functions: // queue::push(), queue::pop(), queue::empty(), queue::back(), // queue::front(),queue::size() #include <list> #include <iostream> #include <queue> #include <deque> using namespace std ; // Using queue with list typedef list<int > INTLIST; typedef queue<int> INTQUEUE; // Using queue with deque typedef deque<char*> CHARDEQUE; typedef queue<char*> CHARQUEUE; int main(void) { size_t size_q; INTQUEUE q; CHARQUEUE p; // Insert items in the queue(uses list) q.push(42); q.push(100); q.push(49); q.push(201); // Output the size of queue size_q = q.size(); cout << "size of q is:" << size_q << endl; // Output items in queue using front() // and use pop() to get to next item until // queue is empty while (!q.empty()) { cout << q.front() << endl; q.pop(); } // Insert items in the queue(uses deque) p.push("cat"); p.push("ape"); p.push("dog"); p.push("mouse"); p.push("horse"); // Output the item inserted last using back() cout << p.back() << endl; // Output the size of queue size_q = p.size(); cout << "size of p is:" << size_q << endl; // Output items in queue using front() // and use pop() to get to next item until // queue is empty while (!p.empty()) { cout << p.front() << endl; p.pop(); } } Output size of q is:4 42 100 49 201 horse size of p is:5 cat ape dog mouse horse Requirements Header: <queue> Standard C++ Library Reference queue::back Returns a reference to the last and most recently added element at the back of the queue. value_type& back( ); const value_type& back( ) const; Return Value The last element of the queue. If the queue is empty, the return value is undefined. Remarks If the return value of back is assigned to a const_reference, the queue object cannot be modified. If the return value of back is assigned to a reference, the queue object can be modified. When compiling with _SECURE_SCL 1, a runtime error will occur if you attempt to access an element in an empty queue. See Checked Iterators for more information. Example Copy Code // queue_back.cpp // compile with: /EHsc #include <queue> #include <iostream> int main( ) { using namespace std; queue <int> q1; q1.push( 10 ); q1.push( 11 ); int& i = q1.back( ); const int& ii = q1.front( ); cout << "The integer at the back of queue q1 is " << i << "." << endl; cout << "The integer at the front of queue q1 is " << ii << "." << endl; } Output The integer at the back of queue q1 is 11. The integer at the front of queue q1 is 10. Requirements Header: <queue> Standard C++ Library Reference queue::push Adds an element to the back of the queue. void push( const Type& _Val ); Parameters _Val The element added to the top of the queue. Remarks The top of the queue is the position occupied by the most recently added element and is the last element at the end of the container. Example Copy Code // queue_push.cpp // compile with: /EHsc #include <queue> #include <iostream> int main( ) { using namespace std; queue <int> q1; q1.push( 10 ); q1.push( 20 ); q1.push( 30 ); queue <int>::size_type i; i = q1.size( ); cout << "The queue length is " << i << "." << endl; i = q1.front( ); cout << "The element at the front of the queue is " << i << "." << endl; } Output The queue length is 3. The element at the front of the queue is 10. Requirements Header: <queue> Standard C++ Library Reference queue::pop Removes an element from the front of the queue. void pop( ); Remarks The queue must be nonempty to apply the member function. The top of the queue is the position occupied by the most recently added element and is the last element at the end of the container. Example Copy Code // queue_pop.cpp // compile with: /EHsc #include <queue> #include <iostream> int main( ) { using namespace std; queue <int> q1, s2; q1.push( 10 ); q1.push( 20 ); q1.push( 30 ); queue <int>::size_type i; i = q1.size( ); cout << "The queue length is " << i << "." << endl; i = q1.front( ); cout << "The element at the front of the queue is " << i << "." << endl; q1.pop( ); i = q1.size( ); cout << "After a pop the queue length is " << i << "." << endl; i = q1. front ( ); cout << "After a pop, the element at the front of the queue is " << i << "." << endl; } Output The queue length is 3. The element at the front of the queue is 10. After a pop the queue length is 2. After a pop, the element at the front of the queue is 20. Requirements Header: <queue> Standard C++ Library Reference queue::front Returns a reference to the first element at the front of the queue. value_type& front( ); const value_type& front( ) const; Return Value The first element of the queue. If the queue is empty, the return value is undefined. Remarks If the return value of front is assigned to a const_reference, the queue object cannot be modified. If the return value of front is assigned to a reference, the queue object can be modified. The member function returns a reference to the first element of the controlled sequence, which must be nonempty. When compiling with _SECURE_SCL 1, a runtime error will occur if you attempt to access an element in an empty queue. See Checked Iterators for more information. Example Copy Code // queue_front.cpp // compile with: /EHsc #include <queue> #include <iostream> int main() { using namespace std; queue <int> q1; q1.push( 10 ); q1.push( 20 ); q1.push( 30 ); queue <int>::size_type i; i = q1.size( ); cout << "The queue length is " << i << "." << endl; int& ii = q1.back( ); int& iii = q1.front( ); cout << "The integer at the back of queue q1 is " << ii << "." << endl; cout << "The integer at the front of queue q1 is " << iii << "." << endl; } Output The queue