#include<iotream>
#include<stdio.h>
#include<stdlib.h>
using namespace std;
// 构造节点
typedef struct StackNode{
int data;
struct StackNode *next;
}StackNode,*LinkStackPrt;
//构造链栈
typedef struct LinkStack{
LinkStackPrt top;
int count;
}LinkStack;
//初始化
void init_Stack(LinkStack &s){
s->top = -1;
}
//判断栈空
bool empty_Stack(LinkStack &s){
return (s->top == -1)? false:true;
}
//进栈
LinkStack push_Stack(LinkStack &s){
LinkStackPrt p = (LinkStackPrt)malloc(sizeof(StackNode));
int x;
scanf("%d",&x);
while(x!=999){
p->data = x;
p->next = s->top;
s->top = p;
s->count++;
scanf("%d",&x);
}
return LinkStack;
}
//出栈
Status pop_Stack(LinkStack &s){
LinkStackPrt p;
if(empty_Stack(&s))
return ERROR;
p = s->top;
s->top = s->top->next;
free(p);
s->count--;
return OK;
}
int main(){
LinkStack s;
return 0;
}
本文内容由网友自发贡献,版权归原作者所有,本站不承担相应法律责任。如您发现有涉嫌抄袭侵权的内容,请联系:hwhale#tublm.com(使用前将#替换为@)