3.1作业

最新推荐文章于 2024-08-13 14:56:59 发布

WPU202331060228

最新推荐文章于 2024-08-13 14:56:59 发布

阅读量85

点赞数 1

文章标签：算法

本文链接：https://blog.csdn.net/WPU202331060228/article/details/138200772

版权

本文介绍了使用C语言实现的一个字符栈，包括栈的初始化、push（入栈）和pop（出栈）操作，以及一个简单的push-pop测试函数。当尝试将超过栈容量的元素压入栈时，会显示栈满错误。

摘要由CSDN通过智能技术生成

代码

#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. ----