括号配对问题
时间限制:
3000 ms | 内存限制:
65535 KB
难度:
3
-
描述
-
现在,有一行括号序列,请你检查这行括号是否配对。
-
输入
- 第一行输入一个数N(0<N<=100),表示有N组测试数据。后面的N行输入多组输入数据,每组输入数据都是一个字符串S(S的长度小于10000,且S不是空串),测试数据组数少于5组。数据保证S中只含有"[","]","(",")"四种字符 输出
- 每组输入数据的输出占一行,如果该字符串中所含的括号是配对的,则输出Yes,如果不配对则输出No 样例输入
-
3 [(]) (]) ([[]()])
样例输出
-
No No Yes
来源
- 网络 上传者
#include<stdio.h> #include<stdlib.h> #include<math.h> #define STACK_INIT_SIZE 20 #define STACKINCREMENT 10 typedef char ElemType; typedef struct { ElemType *top; ElemType *base; int stackSize; }sqStack; void InitStack(sqStack *s) { s->base = (ElemType *)malloc(STACK_INIT_SIZE * sizeof(ElemType)); if(!s->base) { exit(0); } s->top = s->base; s->stackSize = STACK_INIT_SIZE; } void Push(sqStack *s,ElemType e) { if(s->top - s->base >= s->stackSize) //空间不足 { s->base = (ElemType *)realloc(s->base,(s->stackSize + STACKINCREMENT) * sizeof(ElemType)); if(!s->base) { exit(0); } s->top = s->base + s->stackSize; s->stackSize = s->stackSize + STACKINCREMENT; } *(s->top) = e; s->top++; } void Pop(sqStack *s,ElemType *e) { if(s->top == s->base) return; *e=*--(s->top); } int StackLen(sqStack s) { return (s.top-s.base); } void ClearStack(sqStack *s) { s->top = s->base; } int match(ElemType e,ElemType c) { if(e == '(' && c == ')') return 1; if(e == '[' && c == ']') return 1; return 0; } int main() { int n; sqStack s; ElemType e,c; InitStack( &s ); scanf("%d",&n); getchar(); while(n--) { scanf("%c",&c); while(c != '\n') { if(!StackLen(s)) { Push(&s,c); } else { Pop(&s,&e); if(!match(e,c)) { Push(&s,e); Push(&s,c); } } scanf("%c",&c); } // getchar(); if(!StackLen(s)) printf("Yes\n"); else printf("No\n"); ClearStack(&s); } return 0; }