• 括号配对问题


    括号配对问题

    时间限制: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<string.h>
    void main()
    {
        int N;
        scanf("%d", &N);
        char m[128];
        gets(m);
        char s[30];
        char t[30];
        int i, j, k;
        int * flag = (int *)malloc(N*sizeof(int));
        for (i = 0; i < N; i++)
        {
            j = 0;
            k = 0;
            gets(s);
            flag[i] = 1;
            if (strlen(s) % 2 != 0)
            {
                flag[i] = 0;
            }
            else
            {
                while (s[j] != '')
                {
                    if (s[j] == '(' || s[j] == '[')
                    {
                        t[k] = s[j];
                        k++;
                        j++;
                    }
                    else
                    {
                        if (s[j] != '['&&s[j] != ']'&&s[j] != '('&&s[j] != ')')
                        {
                            flag[i] = 2;
                            break;
                        }
                        else
                        if (s[j] == ')')
                        {
                            if (t[k - 1] != '(')
                            {
                                flag[i] = 0;
                                break;
                            }
                            else
                            {
                                k--;
                                j++;
                            }
                        }
                        else
                        if (s[j] == ']')
                        {
                            if (t[k - 1] != '[')
                            {
                                flag[i] = 0;
                                break;
                            }
                            else
                            {
                                k--;
                                j++;
                            }
    
                        }
                        else
                        {
                            j++;
                        }
                    }
                }
            }
        }
        for (i = 0; i < N; i++)
        {
            if (flag[i] == 0)
            {
                printf("No
    ");
            }
            else
            if (flag[i] == 1)
            {
                printf("Yes
    ");
            }
            else if (flag[i] == 2)
            {
                printf("非法字符
    ");
            }
        }
        system("pause");
    }
  • 相关阅读:
    HLS Coding Style: Hardware Efficient C Code
    HLS Coding Style: Arrays and Data Types
    HLS Coding Style: Unsupported C Constructs
    HLS Optimization: Latency V.S. Throughput
    HLS Optimization: Pipeline V.S. Unroll
    HLS Coding Style: Functions and Loops
    HLS Optimization: Latency
    HLS Optimization: Throughput
    hive常见报错
    Neo4j 第三篇:Cypher查询入门
  • 原文地址:https://www.cnblogs.com/JsonZhangAA/p/5355914.html
Copyright © 2020-2023  润新知