数据结构----栈

#include <stdio.h>
#include <malloc.h>
#define STACK_MAX_SIZE 10
typedef struct CharStack {
	int top;
	char data[STACK_MAX_SIZE];
}*CharStackPtr;

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

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

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

char pop(CharStackPtr paraStackPtr) {
	if (paraStackPtr->top < 0) {
		printf("Cannot pop element: stack empty.\r\n");
		return ;
	}
	paraStackPtr->top--; 
	return paraStackPtr->data[paraStackPtr->top + 1];
}

void pushPopTest() {
	char ch;
	int i;
	printf("---- pushPopTest begins. ----\r\n");

	
	CharStackPtr tempStack = charStackInit();
	printf("After initialization, 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");
}

int main() {
	pushPopTest();
	return 0;
}

运行结果：

---- pushPopTest begins. ----
After initialization, the stack is:
Pushing a.
a
Pushing b.
ab
Pushing c.
abc
Pushing d.
abcd
Pushing e.
abcde
Pushing f.
abcdef
Pushing g.
abcdefg
Pushing h.
abcdefgh
Pushing i.
abcdefghi
Pushing j.
abcdefghij
Pushing k.
Cannot push element: stack full.
abcdefghij
Pushing l.
Cannot push element: stack full.
abcdefghij
Pop j.
abcdefghi
Pop i.
abcdefgh
Pop h.
abcdefg
---- pushPopTest ends. ----

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