UVa 673 Parentheses Balance

最新推荐文章于 2019-03-23 12:45:49 发布

万木春《Linux 后端开发工程实践》

最新推荐文章于 2019-03-23 12:45:49 发布

阅读量949

点赞数

CC 4.0 BY-SA版权

分类专栏： UVa 文章标签： input 2010

本文链接：https://blog.youkuaiyun.com/ACb0y/article/details/5353285

UVa 专栏收录该内容

92 篇文章

订阅专栏

/* coder:ACboy date: 2010-3-7 result: AC description: UVa 673 Parentheses Balance */ #include <iostream> using namespace std; char stack[128]; int top; int match(char & a, char & b) { if ((a == '(' && b == ')') || (a == '[' && b == ']')) { return 1; } else return 0; } int main() { int n; #ifndef ONLINE_JUDGE freopen("673.txt", "r", stdin); #endif scanf("%d/n", &n); while (n--) { char input[128] = {0}; gets(input); if (input == "") { cout << "Yes" << endl; continue; } top = 0; int len = strlen(input); for (int i = 0; i < len; i++) { if (input[i] == '(' || input[i] == '[') { stack[top++] = input[i]; } else if (input[i] == ')' || input[i] == ']') { if (match(stack[top - 1], input[i])) { top--; } else { stack[top++] = input[i]; } } } if (top == 0) cout << "Yes" << endl; else cout << "No" << endl; } return 0; }