Push and pop an int stack : stack « queue stack « C++ Tutorial






  1. C++ Tutorial
  2. queue stack
  3. stack
#include <iostream>
using std::cout;
using std::endl;

#include <stack>  // stack adapter definition
#include <vector> // vector class-template definition
#include <list>   // list class-template definition

int main()
{
   // stack with default underlying deque
   std::stack< int > intStack;

   for ( int i = 0; i < 10; i++ )
   {
      intStack.push( i );
      cout << "\n\n\npushing: "<< intStack.top() << ' \n';
   }


   while ( !intStack.empty() )
   {
      cout << "\n\n\ntopping: "<<intStack.top() << ' \n';
      intStack.pop();
   }

   return 0;
}

pushing: 08202


pushing: 18202


pushing: 28202


pushing: 38202


pushing: 48202


pushing: 58202


pushing: 68202


pushing: 78202


pushing: 88202


pushing: 98202


topping: 98202


topping: 88202


topping: 78202


topping: 68202


topping: 58202


topping: 48202


topping: 38202


topping: 28202


topping: 18202


topping: 08202




21.1.stack
21.1.1.Instantiation of an STL Stack
21.1.2.Push and pop an int stack
21.1.3.Push and pop a vector stack
21.1.4.Push and pop a stack of list
21.1.5.Working with a stack of Integers
21.1.6.Stack: size, pop and push
21.1.7.Stack: size and push
21.1.8.Stack: top, empty
21.1.9.Modify the top element in a stack
21.1.10.stack of string and vector of string
21.1.11.A stack for characters
21.1.12.stack of pairs
21.1.13.Pass stack to a function