C++数据结构与程序设计学习1-栈的应用与实现

栈作为一种最简单的数据结构，有着后进先出特性，在STL标准模板库中实现，下篇提供栈的具体c++实现，这次试用stl模板类来实现数字的反序排列,用到了栈的pop(),empty(),top()push()等操作

#include<iostream>

#include<stack>

using namespace std;

int main(){

/*pre:the user input a integer n and ndecimal numbers

  post:The numbers are printed in reverse order.

  uses:the stl class stack and its methods

*/

int n;

double item;

stack<double>numbers;

cout<<"please input the number that you want to reverse"<<endl;

cout<<"the numbers will be printed in reverse order."<<endl;

cin>>n;

for(int i=0;i<n;i++)

{

cin>>item;

numbers.push(item);

}

while(!numbers.empty()){

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

numbers.pop();

}

cout<<endl;

return 0;

}