Stack of string and vector: push(), pop(), empty(), top() : stack « Queue Stack « C++

1.	Bitset
2.	Class
3.	Console
4.	Data Structure
5.	Data Type
6.	Deque
7.	Development
8.	File
9.	Function
10.	Generic
11.	Language
12.	List
13.	Map Multimap
14.	Overload
15.	Pointer
16.	Qt
17.	Queue Stack
18.	Set Multiset
19.	STL Algorithms Binary search
20.	STL Algorithms Heap
21.	STL Algorithms Helper
22.	STL Algorithms Iterator
23.	STL Algorithms Merge
24.	STL Algorithms Min Max
25.	STL Algorithms Modifying sequence operations
26.	STL Algorithms Non modifying sequence operations
27.	STL Algorithms Sorting
28.	STL Basics
29.	String
30.	Valarray
31.	Vector

C / ANSI-C

C Tutorial

C++ Tutorial

Visual C++ .NET

C++ » Queue Stack » stack

Screenshots

Stack of string and vector: push(), pop(), empty(), top()

  

#include <iostream>

#include <string>

#include <stack>

#include <vector>

using namespace std;



int main()

{

     stack< string, vector<string> > s;



     s.push( "me" );



     s.push( "to" );

     s.push( "talk" );

     while ( !s.empty() ) {

          cout << s.top() << " ";

          s.pop();

     }

     return 0;

}

Related examples in the same category

1.	Push and pop an int stack
2.	Push and pop a vector stack
3.	Push and pop a stack of list
4.	Stack: size, pop and push
5.	Stack: size and push
6.	Stack: top, empty
7.	Modify the top element in a stack
8.	Pass stack to a function

www.java2java.com | Contact Us

All other trademarks are property of their respective owners.