Stack: top, empty : stack « Queue Stack « C++

1. C++
2. Queue Stack
3. stack

Stack: top, empty

  
 

#include <iostream>
#include <stack>
using namespace std;

int main()
{
  int thedata[] = {45, 34, 56, 27, 71, 50, 62};
  stack<int> s;
  cout << "The stack size is now " << s.size() << endl;

  cout << "Pushing 4 elements " << endl;
  for (int i = 0; i < 4; ++i)
    s.push(thedata[i]);
    
  cout << "The stack size is now " << s.size() << endl;

  cout << "Popping 3 elements " << endl;
  for (int i = 0; i < 3; ++i) {
    cout << s.top() << endl;
    s.pop();
  }
  cout << "The stack size is now " << s.size() << endl;

  cout << "Popping all elements" << endl;
  while (!s.empty()) {
    cout << s.top() << endl;
    s.pop();
  } 
  cout << "The stack size is now " << s.size() << endl;
  
  return 0;
}

/* 
The stack size is now 0
Pushing 4 elements
The stack size is now 4
Popping 3 elements
27
56
34
The stack size is now 1
Popping all elements
45
The stack size is now 0

 */        
    
  

Related examples in the same category