| Time Limit: 3000MS | Memory Limit: Unknown | 64bit IO Format: %lld & %llu |
Description
You are given a string consisting of parentheses () and []. A string of this type is said to be correct:
Write a program that takes a sequence of strings of this type and check their correctness. Your program can assume that the maximum string length is 128.
3 ([]) (([()]))) ([()[]()])()
Yes No Yes
#include<cstdio> #include<cstring> #include<stack> using namespace std; stack<char> st; char s[1000]; bool check() { for (int i = 0; i < strlen(s) - 1; ++i) if (s[i] == ‘(‘ || s[i] == ‘[‘) st.push(s[i]); else if (st.empty()) return false; else if ((st.top() == ‘(‘ && s[i] == ‘)‘) || (st.top() == ‘[‘ && s[i] == ‘]‘)) st.pop(); else return false; return st.empty(); } int main() { int Test; scanf("%d", &Test); getchar(); while (Test--) { fgets(s, 1000, stdin); while (!st.empty()) st.pop(); if (check()) printf("Yes\n"); else printf("No\n"); } return 0; }
原文：http://www.cnblogs.com/albert7xie/p/4854149.html