数据结构之---C语言实现括号匹配（栈实现）

最新推荐文章于 2022-09-29 22:05:00 发布

杨鑫newlfe

最新推荐文章于 2022-09-29 22:05:00 发布

阅读量2.4w

点赞数 35

分类专栏：数据结构 C && C++ 算法

本文链接：https://blog.csdn.net/u012965373/article/details/48420361

版权

算法同时被 3 个专栏收录

808 篇文章 1322 订阅 ¥9.90 ¥99.00

订阅专栏

C && C++

400 篇文章 1376 订阅 ¥9.90 ¥99.00

订阅专栏

数据结构

133 篇文章 1338 订阅 ¥9.90 ¥99.00

订阅专栏

#include <stdio.h>
#include <stdlib.h>
#define STACKINCREAMENT 10
#define STACK_INIT_SIZE 100
#define OVERFLOW -2
#define OK 1
#define ERROR 0
typedef int status;
typedef char SElemtype;
typedef struct
{
	SElemtype *base;
	SElemtype *top;
	status stacksize;
}sqstack;

//初始化栈
status Init(sqstack *s)
{
	s->base = (SElemtype *)malloc(STACK_INIT_SIZE * sizeof(SElemtype));
	if(!s->base) 
			exit(OVERFLOW);
	s->top = s->base;
	s->stacksize = STACK_INIT_SIZE ;
	return OK;
}

//获取栈顶元素
status Gettop(sqstack *s, SElemtype e)
{
	if(s->top == s->base) 
			return ERROR;
	e = *(s->top-1);
	return OK;
}

//压栈
status push(sqstack *s, SElemtype e)
{
	if(s->top - s->base >= s->stacksize)
	{
      s->base = (SElemtype *)realloc(s->base, (s->stacksize + STACKINCREAMENT) * sizeof(SElemtype));
	  if(!s->base)
			  exit(OVERFLOW);
      s->top = s->base + s->stacksi

了解本专栏