#include <stdio.h>
#include <malloc.h>
#define STACK_MAX_SIZE 10
typedef struct CharStack {
int top;
int data[STACK_MAX_SIZE];
} *CharStackPtr;
void outputStack(CharStackPtr paraStack) {
int i = 0;
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) {
// Step 1. 合法性检验
if (paraStackPtr->top >= STACK_MAX_SIZE - 1) {
printf("Cannot push element: stack full.\r\n");
return;
}
// Step 2. 更新顶
paraStackPtr->top ++;
// Step 3. 压栈
paraStackPtr->data[paraStackPtr->top] = paraValue;
}
char pop(CharStackPtr paraStackPtr) {
// Step 1. 合法性检验
if (paraStackPtr->top < 0) {
printf("Cannot pop element: stack empty.\r\n");
return '\0';
}
// Step 2. 更新栈顶
paraStackPtr->top --;
// Step 3. 压栈
return paraStackPtr->data[paraStackPtr->top + 1];
}
void pushPopTest() {
printf("---- pushPopTest begins. ----\r\n");
// 初始化
CharStackPtr tempStack = charStackInit();
printf("After initialization, the stack is: ");
outputStack(tempStack);
// 弹出
char ch = 'a';
for (ch; ch < 'm'; ch ++) {
printf("Pushing %c.\r\n", ch);
push(tempStack, ch);
outputStack(tempStack);
}
int i = 0;
for (i; i < 3; i ++) {
ch = pop(tempStack);
printf("Pop %c.\r\n", ch);
outputStack(tempStack);
}
printf("---- pushPopTest ends. ----\r\n");
}
void main() {
pushPopTest();
}
后进先出,在改变顶部