水题

最新推荐文章于 2021-05-23 11:49:54 发布

原创最新推荐文章于 2021-05-23 11:49:54 发布 · 190 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

CQUPT 2018 寒假训练 DIV2 （1）STL基础专栏收录该内容

4 篇文章

订阅专栏

本文介绍了一个简单的括号匹配算法，该算法使用栈来检查由圆括号和方括号组成的字符串是否正确配对。通过一系列输入样例展示了如何判断括号序列的有效性。

You are given a string consisting of parentheses () and []. A string of this type is said to be correct:(a) if it is the empty string(b) if A and B are correct, AB is correct,(c) if A is correct, (A) and [A] is correct.Write a program that takes a sequence of strings of this type and check their correctness. Yourprogram can assume that the maximum string length is 128.

InputThe file contains a positive integer n and a sequence of n strings of parentheses ‘()’ and ‘[]’, one stringa line.

OutputA sequence of ‘Yes’ or ‘No’ on the output file.

Sample Input

([])

(([()])))

([()[]()])()

Sample Output

Yes

题意：括号配对，只有两种括号（）和【】，给你一串字符串，判断括号是否配对

用栈就可以了

#include<stdio.h>
int main()
{
    int top,t,i;
    char s[200],ch[200];
    scanf("%d\n",&t);
    while (t--)
    {
        gets(s);
        top=0;
        for (i=0;s[i]!='\0';i++)
       {
       ch[top]=s[i];
       if ((ch[top-1]=='(')&&(ch[top]==')')) top-=2;
       if ((ch[top-1]=='[')&&(ch[top]==']')) top-=2;
       ++top;
       ch[top]='\0';
        }
       if (top==0) printf("Yes\n");
        else printf("No\n");
     }
 return 0;
}