栈的基本实现
#include<iostream>
#include<stdio.h>
#include<malloc.h>
typedef struct Node {
int data;
struct Node *pNext;
}NODE, *PNODE;
typedef struct Stack {
PNODE pTop;
PNODE pBottom;
}STACK,*PSTACK;
void initStack(PSTACK );
void pushStack(PSTACK, int);
bool popStack(PSTACK, int *);
void traverse(PSTACK);
bool empyt(PSTACK);
void clear(PSTACK pS);
void main() {
STACK S;
int val;
initStack(&S);
pushStack(&S, 1);
pushStack(&S, 2);
pushStack(&S, 5);
pushStack(&S, 7);
pushStack(&S, 9);
traverse(&S);
if (popStack(&S,&val))
{
printf("出栈成功,出栈的元素是%d\n", val);
}
else {
printf("出栈失败\n");
}
traverse(&S);
clear(&S);
traverse(&S);
system("pause");
}
void initStack(PSTACK pS) {
pS->pTop = (PNODE)malloc(sizeof(NODE));
if (NULL == pS->pTop) {
printf("动态内存分配失败!\n");
exit(-1);
}
else {
pS->pBottom = pS->pTop;
pS->pTop->pNext = NULL;
}
}
void pushStack(PSTACK pS, int val) {
PNODE pNew = (PNODE)malloc(sizeof(NODE));
pNew->data = val;
pNew->pNext = pS->pTop;
pS->pTop = pNew;
return;
}
bool popStack(PSTACK pS, int* pVal) {
if (empyt(pS))
{
return false;
}
else {
PNODE r = pS->pTop;
*pVal = r->data;
pS->pTop = r->pNext;
free(r);
r = NULL;
return true;
}
}
bool empyt(PSTACK pS) {
if (pS->pTop == pS->pBottom)
return true;
else
return false;
}
void traverse(PSTACK pS) {
PNODE p = pS->pTop;
while (p!=pS->pBottom)
{
printf("%d ", p->data);
p = p->pNext;
}
printf("\n");
return;
}
void clear(PSTACK pS) {
if (empyt(pS))
{
return;
}
else {
PNODE p = pS->pTop;
PNODE q = NULL;
while (p != pS->pBottom) {
q = p->pNext;
free(p);
p = q;
}
pS->pTop = pS->pBottom;
}
}