//C v0.01 不知題意，正在理解，正在（一）上修改。 #include <stdio.h> #include <string.h> #include <stdlib.h> #define STACK_SIZE 10000 typedef struct STACK{ char stack[STACK_SIZE]; int pointer; }STSTACK; STSTACK stack; void push(char ch); char pop(); int main(int argc, char *argv[]) { int num; int i; char buf[STACK_SIZE]={0}; int sum = 0; scanf("%d",&num); getchar(); for(i = 0;i < num;i++){ memset(stack.stack, 0x00, STACK_SIZE); stack.pointer = -1; scanf("%s", buf); getchar(); int len = strlen(buf); //printf("%d\n",len); int j; int flag=1; for(j = 0;j < len;j++){ char tmp; if(buf[j] == '[' || buf[j] == '('){ push(buf[j]); }else if (buf[j] == ']') { if(stack.pointer == -1){ //--stack.pointer; flag = 0; push(buf[j]); //++sum; //printf("No\n"); //break; continue; } tmp = pop(); if(tmp != '['){ //push(tmp); //printf("No\n"); flag = 0; push(tmp); push(buf[j]); //break; continue; }/*else if(tmp == '['){ continue; }*/ }else if (buf[j] == ')') { if(stack.pointer == -1){ // --stack.pointer; flag = 0; push(buf[j]); //++sum; //printf("No\n"); //break; continue; } tmp = pop(); if(tmp != '('){ //push(tmp); //printf("No\n"); flag = 0; push(tmp); push(buf[j]); //break; continue; }/*else if(tmp == '('){ continue; }*/ } } if(stack.pointer == -1 && flag){ //printf("Yes\n"); printf("0\n"); }else{ //printf("No\n"); printf("%d\n",stack.pointer+1); } } return 0; } void push(char ch){ stack.stack[++stack.pointer] = ch; } char pop(){ return stack.stack[stack.pointer--]; }

轉(zhuǎn)載于:https://www.cnblogs.com/guxuanqing/p/5638610.html

總結(jié)

以上是生活随笔為你收集整理的括号匹配（二）的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。