括号匹配顺序栈

#include <iostream>
#include "ac.h"

using namespace std;

/* run this program using the console pauser or add your own getch, system("pause") or input loop */

int main(int argc, char** argv) {
	stack head ;
	
	while(1){
		printf("1.创建栈\n");
		printf("2.弹出栈顶元素\n");
		printf("3.压入元素\n");
		printf("4.遍历输出栈\n");
		printf("5.退出程序\n");
		printf("6.括号匹配\n");
		printf("请输入你的选择: ");
		
		int q ;
		scanf("%d",&q);
		
		switch(q){
			case 1:{
				creatStack(head);
				break;
			}
			
			
			case 2:{
				Element e;
				if(popStack(head,e))
					printf("栈顶元素为：%c\n",e);
				break;
			}
			
			case 3:{
				int cn;
				printf("请输入你要压入栈的元素个数\n");
				scanf("%d",&cn); 
				 getchar();
				for(int i = 0 ; i < cn ; i ++){
					Element s ;
					scanf("%c",&s);
					
					pushStack(head,s);
				}
				break;
			} 
			
			case 4:{
				print(head);
				break;
			}
			
			case 5:{
				printf("退出程序\n");
				return 0;
				break;
			}
			
			case 6:{
				creatStack(head);
				string s;
				getchar();
				printf("请输入一系列括号：");
				bool st = true;
				cin>>s;
				
				for(int i = 0 ; i < s.length() ; i ++){
					if(s[i] == '(' || s[i] == '[' || s[i] == '{') pushStack(head,s[i]);
					
					
					char q;
					if((s[i] == ')' || s[i] == ']' || s[i] == '}') && (!popStack(head,q) || q + 1 != s[i])){
						st = false;
					}
				}	
					
				if(!st) printf("括号不匹配！！\n");	
				else{
					printf("括号匹配成功！！！\n");
				} 
				break;
			}
		}
	}
	return 0;
}

#include<iostream>
#include<malloc.h>
#define Max 100

using namespace std;
typedef char Element;

typedef struct stack
{
	Element *top;
	Element *base;
	int size;
}stack;

void creatStack(stack &head);

int popStack(stack &head , Element &e);

void pushStack(stack &head , Element e);

void print(stack &head);

#include "ac.h"

void creatStack(stack &head)
{
	head.top = (Element *)malloc(sizeof(Element)*Max);
	if(head.top == NULL){
		printf("内存分配失败\n");
		return ;
	}
	
	head.base = head.top;
	head.size = 0;
	
	printf("创建成功！！！\n");
}

int popStack(stack &head , Element &e)
{
	if(head.size == 0 || head.top == head.base){
		printf("栈为空\n");
		return 0;
	}
	e = *(--head.base );
	head.size --;
	return 1;
}

void pushStack(stack &head , Element e)
{
	if((head.size + 1) % Max == 0 && head.size){
		head.base = (Element *)malloc(sizeof(Element)*Max);
	}
	
	*(head.base ++) = e;
	
	head.size ++;
	
	//printf("压栈成功\n");
}

void print(stack &head)
{
	stack q = head;
	if(q.top == q.base){
		printf("栈为空\n");
		return ;
	}
	
	while(q.top != q.base){
		printf("%d ",*(q.top++));
	}
	printf("\n"); 
}