郝斌数据结构（三）：动态栈

/*演示动态栈，链表为内核，先进后出*/
#include <STDIO.H>
#include <MALLOC.H>
#include <STDLIB.H>


typedef struct Node
{
int data;
struct Node *pNext;
}NODE, *PNODE;

typedef struct Stack
{
PNODE pTop;
PNODE pBottom;
}STACK, *PSTACK;
/*静态栈需要两个节点指针，一个头一个尾*/

void init(PSTACK); 
void push(PSTACK, int);
int traverse(PSTACK);
bool empty( PSTACK);
bool pop(PSTACK, int *);
void clear(PSTACK);


int main(void)
{
STACK S;//STACK等价于struct Stack
int len;
int val;

init( &S );//目的是造出一个空栈
push( &S, 1 );//压栈
push( &S, 2 );
push( &S, 3 );
push( &S, 4 );
push( &S, 5 );
push( &S, 6 );
push( &S, 7 );


if( pop( &S, &val ) )
{
printf( "出栈成功,出栈的元素是%d\n", val );
}
else
{
printf( "出栈失败" );
}
// len = traverse(&S);//遍历输出
// printf("栈有%d个长\n", len);
clear(&S);
traverse(&S);


return 0;
}


/*初始化栈，头尾指针指向尾节点，尾节点并未放入数据，头指针用来进出栈，尾指针用来方便操作的*/
void init(PSTACK pS)
{
pS->pTop = (PNODE)malloc(sizeof(NODE));
if (NULL == pS->pTop)
{
printf("动态内存分配失败!\n");
exit(-1);
}
else
{
pS->pTop->pNext = NULL;
pS->pBottom = pS->pTop;
}
}

void push(PSTACK pS, int val)
{
PNODE pNew = (PNODE)malloc(sizeof(Node));
pNew->data = val;
pNew->pNext = pS->pTop;
pS->pTop = pNew;


return;
}


int traverse(PSTACK pS)
{
int len = 0;
PNODE p = pS->pTop;
while(p != pS->pBottom)
{
printf("%d ", p->data);
p = p->pNext;
len++;
}
printf("\n");


return len;
}


bool empty( PSTACK pS )
{
if( pS->pTop == pS->pBottom )
return true;
else
return false;
}


bool pop(PSTACK pS, int *pVal)
{
if(empty(pS))
{
return false;
}
else
{
PNODE p = pS->pTop;
*pVal = p->data;
pS->pTop = p->pNext;
free(p);
p = NULL;


return true;
}
}


void clear(PSTACK pS)
{
if (empty(pS))
{
return;
}
else
{
PNODE p = pS->pTop;
while(pS->pTop != pS->pBottom)
{
pS->pTop = p->pNext;
free(p);
p = pS->pTop;
}
}
}