栈的顺序存储括号匹配

最新推荐文章于 2021-05-21 18:35:48 发布

原创最新推荐文章于 2021-05-21 18:35:48 发布 · 212 阅读

CC 4.0 BY-SA版权

#include "strack.h"
int main()
{
   char e;
   char a;
   StrackPtr s = InitStrack();//初始化栈
   int count = 0;
   char string[50] = {0};
   gets(string);

   int n = strlen(string);
   //printf("%d", n);
   while (count < n)
   {
       if (string[count] == '(' || string[count] == ')' || string[count] == '[' || string[count] == ']' || string[count] == '{' || string[count] == '}')
       {
           switch (string[count])
           {
           case '(':
               PushStrack(s, string[count]);
               //puts("111");
               break;
           case '[':
               PushStrack(s, string[count]);
               break;
           case '{':
               PushStrack(s, string[count]);
               break;
           case ')':
               if (!StrackEmpty(s))
               {
                   GetTop(s, &e);

                   if (e == '(')
                   {
                       Pop(s, &a);
                   }
               }
               break;
           case ']':
               if (!StrackEmpty(s))
               {
                   GetTop(s, &e);

                   if (e == '[')
                   {
                       Pop(s, &a);
                   }
               }
               break;
           case '}':
               if (!StrackEmpty(s))
               {
                   GetTop(s, &e);

                   if (e == '{')
                   {
                       Pop(s, &a);
                   }
               }
               break;
           defaule:
               break;

           }
       }
       count++;
   }

   if (StrackEmpty(s))
   {
       puts("匹配成功");
   }
   else
   {
       puts("匹配失败");
   }
   system("pause");
   return 0;
}