3.1 栈

Afterglow368

已于 2024-05-06 21:42:12 修改

阅读量164

点赞数 2

分类专栏：数据结构文章标签：算法

于 2024-04-25 15:54:44 首次发布

本文链接：https://blog.csdn.net/2303_80396098/article/details/138191644

版权

数据结构专栏收录该内容

13 篇文章 0 订阅

订阅专栏

文章详细介绍了如何在C语言中使用结构体和指针实现栈，包括栈的初始化、push和pop操作，并提供了pushPopTest函数的运行结果实例。

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

一、代码

#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) {
	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;
	printf("----pushPopTest begins.----\r\n");
	
	
	CharStackPtr tempStack = charStackInit();
	printf("After initializatio, the stack is: ");
	outputStack(tempStack);
	
	
	for (ch = 'a'; ch < 'm'; ch++) {
		printf("Pushing %c.\r\n", ch);
		push(tempStack, ch);
		outputStack(tempStack);
	}
	
	
	for(int 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 initializatio, 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.----

--------------------------------