int main()
{
char s[10000];
int x = 1;
while (cin>>s && s[0] != '-') {
int i, l = strlen(s);
stack<char> S;
int ans = 0;
int left = 0, right = 0;
for (i = 0; i < l; ++i) {
if (s[i] == '{') {
++left;
S.push(s[i]);
} else {
if (S.empty()) {
++right;
} else {
char c = S.top();
if (c == '{') {
--left;
S.pop();
}
}
}
}
if (left % 2 == 0)
ans += left / 2 + right / 2;
else
ans += (left - 1) / 2 + (right - 1) / 2 + 2;
printf("%d. %d\n", x++, ans);
}
return 0;
}
POJ-3991(左括号右括号调整)
最新推荐文章于 2023-07-07 15:17:08 发布