数据结构作业之栈

1.代码如下

#include <stdio.h>
#include <malloc.h>

#define STACK_MAX_SIZE 10

/** 
 * define the stack
 */

typedef struct CharStack * CharStackPtr;
struct CharStack
{
	int top;
	char data[STACK_MAX_SIZE];
};


/** 
 * output the stack
 */

void outputStack(CharStackPtr paraStack)
{
	int i;
	for(i=0;i<=paraStack->top;i++)
	{
		printf("%c ",paraStack->data[i]);
	}
	printf("\r\n");
}

/**
 * initialize the stack
 */

CharStackPtr charStackInit()
{
	CharStackPtr resultPtr=(CharStackPtr)malloc(sizeof(struct CharStack));
	resultPtr->top=-1;
	return resultPtr;
}

/**
 * push an element to the stack
 */

void push(CharStackPtr paraStackPtr, int paraValue)
{
	//step 1. check if the stack is full
	if(paraStackPtr->top>=STACK_MAX_SIZE-1)
	{
		printf("Cannot push element: stack full.\r\n");
		return ;
	}
	
	//step 2. update the top
	paraStackPtr->top++;
	
	//step 3.push element
	paraStackPtr->data[paraStackPtr->top]=paraValue;
}

char pop(CharStackPtr paraStackPtr)
{
	//step 1.check if the stack is empty
	if(paraStackPtr->top<0)
	{
		printf("Cannot pop element: stack empty.\r\n");
		return '\0';
	}
	
	//step 2.update the top
	paraStackPtr->top--;
	
	//step 3.pop element
	return paraStackPtr->data[paraStackPtr->top+1];
}

/**
 * test the push function
 */

void pushPopTest()
{
	char ch;
	int i;
	printf("---- pushPopTest begins. ----\r\n");
	
	CharStackPtr tempStack=charStackInit();
	printf("After initializetion, the stack is: ");
	outputStack(tempStack);
	
	for(ch='a';ch<'m';ch++)
	{
		printf("Pushing %c.\r\n",ch);
		push(tempStack,ch);
		outputStack(tempStack);
	 } 
	
	for(i=0;i<3;i++)
	{
		ch=pop(tempStack);
		printf("Pop %c.\r\n",ch);
		outputStack(tempStack);
	}
	
	printf("---- pushPopTest ends. ----\r\n");
}

void main()
{
	pushPopTest();
}

 2.图示

3.代码说明

1）在进行压栈时，需要判断栈是否已满，并及时更新top

2)  在进行出栈时，需要判断栈是否为空，并及时更新top

3）初始top为-1，来 表示没有元素的起始情况

4.运行结果

---- pushPopTest begins. ----
After initializetion, the stack is:
Pushing a.
a
Pushing b.
a b
Pushing c.
a b c
Pushing d.
a b c d
Pushing e.
a b c d e
Pushing f.
a b c d e f
Pushing g.
a b c d e f g
Pushing h.
a b c d e f g h
Pushing i.
a b c d e f g h i
Pushing j.
a b c d e f g h i j
Pushing k.
Cannot push element: stack full.
a b c d e f g h i j
Pushing l.
Cannot push element: stack full.
a b c d e f g h i j
Pop j.
a b c d e f g h i
Pop i.
a b c d e f g h
Pop h.
a b c d e f g
---- pushPopTest ends. ----

--------------------------------
Process exited after 0.06895 seconds with return value 0
请按任意键继续. . .