代码
#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) {
for (int 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'\0';
}
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");
}
void main() {
pushPopTest();
}
运行结果
---- pushPopTest begins. ----
After initialization, 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. ----
代码说明
1.push函数将一个字符压入栈,首先检查栈是否已满,如果栈已满,则输出错误消息并返回,
否则,将栈顶指针加一,表示栈顶位置移动到了下一个位置,在新的栈顶位置存储传入的值
2.pop函数从栈中弹出一个字符,首先检查栈是否为空,如果栈为空,则输出错误消息并返回空字符,否则,将栈顶指针减一,表示栈顶位置移动到了前一个位置,返回当前栈顶位置的字符