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

1.	Language Basics
2.	Data Types
3.	Operators statements
4.	Array
5.	Development
6.	Exceptions
7.	Function
8.	Structure
9.	Class
10.	Operator Overloading
11.	Pointer
12.	File Stream
13.	template
14.	STL Introduction
15.	string
16.	vector
17.	list
18.	bitset
19.	set multiset
20.	valarray
21.	queue stack
22.	deque
23.	map multimap
24.	STL Algorithms Modifying sequence operations
25.	STL Algorithms Non modifying sequence operations
26.	STL Algorithms Binary search
27.	STL Algorithms Sorting
28.	STL Algorithms Merge
29.	STL Algorithms Min Max
30.	STL Algorithms Iterator
31.	STL Algorithms Heap
32.	STL Algorithms Helper

C / ANSI-C

C Tutorial

C++

Visual C++ .NET

C++ Tutorial » queue stack » stack

21.1.5.Working with a stack of Integers

#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

www.java2java.com | Contact Us

All other trademarks are property of their respective owners.