Working with a stack of Integers : stack « queue stack « C++ Tutorial






#include <stack>
#include <iostream>

int main ()
{
    using namespace std;

    stack <int> stackIntegers;

    stackIntegers.push (25);
    stackIntegers.push (10);
    stackIntegers.push (-1);
    stackIntegers.push (5);
 
    cout << stackIntegers.size () << " elements";

    while (stackIntegers.size () != 0)
    {
        cout << stackIntegers.top();
        stackIntegers.pop ();
    }
    if (stackIntegers.empty ())
        cout << endl << "The stack is now empty!";

    return 0;
}








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