#include <stdio.h>
#include<malloc.h>
typedef struct Node
{
int data ;
struct Node* nextNode;
} NODE,* PNODE;
typedef struct Stack
{
PNODE pTop;
PNODE pBottom;
} STACK,*PSTACK;
bool init(PSTACK S);
bool push(PSTACK S,int);
void traverse(PSTACK S);
bool delet(PSTACK S);
bool empy(PSTACK S);
int main()
{
STACK s;
init(&s);
push(&s,1);
push(&s,2);
traverse(&s);
delet(&s);
traverse(&s);
return 0;
}
bool init(PSTACK S)
{
S->pBottom=(PNODE)malloc(sizeof(NODE));
if(S->pBottom==NULL)
{
printf("内存满了 ");
exit(-1);
}
else
{
S->pTop=S->pBottom;
S->pTop->nextNode=NULL;
}
return true;
}
bool push(PSTACK S,int var)
{
PNODE newNode=(PNODE)malloc(sizeof(NODE));
if(NULL==newNode)
{
printf("内存溢出");
exit(-1);
}
else
{
newNode->nextNode=S->pTop;
S->pTop=newNode;
S->pTop->data=var;
}
return true;
}
void traverse(PSTACK S)
{
PNODE linshi =(PNODE)malloc(sizeof(NODE));
linshi=S->pTop;
while(linshi->nextNode!=NULL)
{
printf("%d\n",linshi->data);
linshi=linshi->nextNode;
}
}
bool delet(PSTACK S)
{
if(empy(S))
{
printf("已经没有元素");
return false;
}
else
{
PNODE linshi=S->pTop;
S->pTop=S->pTop->nextNode;
free(linshi);
}
return true;
}
bool empy(PSTACK S)
{
if(S->pBottom==S->pTop)
return true;
else return false;
}
#include<malloc.h>
typedef struct Node
{
int data ;
struct Node* nextNode;
} NODE,* PNODE;
typedef struct Stack
{
PNODE pTop;
PNODE pBottom;
} STACK,*PSTACK;
bool init(PSTACK S);
bool push(PSTACK S,int);
void traverse(PSTACK S);
bool delet(PSTACK S);
bool empy(PSTACK S);
int main()
{
STACK s;
init(&s);
push(&s,1);
push(&s,2);
traverse(&s);
delet(&s);
traverse(&s);
return 0;
}
bool init(PSTACK S)
{
S->pBottom=(PNODE)malloc(sizeof(NODE));
if(S->pBottom==NULL)
{
printf("内存满了 ");
exit(-1);
}
else
{
S->pTop=S->pBottom;
S->pTop->nextNode=NULL;
}
return true;
}
bool push(PSTACK S,int var)
{
PNODE newNode=(PNODE)malloc(sizeof(NODE));
if(NULL==newNode)
{
printf("内存溢出");
exit(-1);
}
else
{
newNode->nextNode=S->pTop;
S->pTop=newNode;
S->pTop->data=var;
}
return true;
}
void traverse(PSTACK S)
{
PNODE linshi =(PNODE)malloc(sizeof(NODE));
linshi=S->pTop;
while(linshi->nextNode!=NULL)
{
printf("%d\n",linshi->data);
linshi=linshi->nextNode;
}
}
bool delet(PSTACK S)
{
if(empy(S))
{
printf("已经没有元素");
return false;
}
else
{
PNODE linshi=S->pTop;
S->pTop=S->pTop->nextNode;
free(linshi);
}
return true;
}
bool empy(PSTACK S)
{
if(S->pBottom==S->pTop)
return true;
else return false;
}