zoukankan      html  css  js  c++  java
  • “链栈”实际代码实现【物联网1132-11】

    #include<iostream.h>         
    
    template<class T>        
    struct STU 
    {
    	T data;
    	STU<T> * next;
    };
    
    template<class T>        
    class LinkStack  
    {  
    public:  
    	 LinkStack(){top=NULL;}   
    	 ~LinkStack(); 
    	 void Push(T x);
    	 T Pop();
    	 T GetTop(){if(top!=NULL)return top->data;};
    	 int Empty(){top==NULL?

    return 1:return 0;}; private: STU<T> * top; }; template<class T> class LinkStack<T>::Push(T x) { s=new STU; s->data=x; s->next=top; top=s; } template<class T> class LinkStack<T>::Pop() { STU<T> *p; T x; if(top=NULL)throw"Wrong"; x=top->data; p=top; top=top->next; delete p; return x; } int main() { LinkStack<int>s1; int m; do{ cout<<"-------------------------"<<endl; cout<<"输入1開始入栈"<<endl; cout<<"输入2開始弹栈"<<endl; cout<<"输入3開始读取栈顶"<<endl; cout<<"输入4開始推断是否空"<<endl; cin>>m; switch(m) { case 1: cout<<"请输入入栈的元素值"<<endl; cin>>a; s1.Push(a); break; case 2: cout<<"此操作为出栈"<<endl; s1.Pop(); break; case 3: int v; cout<<"此操作为读取栈顶"<<endl; s1.GetTop(); break; case 4: cout<<"此操作为推断栈为空"<<endl; s1.Empty(); break; } }while(1); return 0; }


  • 相关阅读:
    设计模式
    操作系统知识点梳理
    jvm面试题
    java排序算法之冒泡排序和快速排序
    使用RAS+AES对接口数据加解密
    MongoDB七-运维技术
    MongoDB三-高级操作
    MongoDB四-操作索引
    quartz详解3:quartz数据库集群-锁机制
    quartz详解4:quartz线程管理
  • 原文地址:https://www.cnblogs.com/blfbuaa/p/6908488.html
Copyright © 2011-2022 走看看