Description
You are given string s consists of opening and closing brackets of four kinds <>, {}, [], (). There are two types of brackets: opening and closing. You can replace any bracket by another of the same type. For example, you can replace < by the bracket {, but you can't replace it by ) or >.
The following definition of a regular bracket sequence is well-known, so you can be familiar with it.
Let's define a regular bracket sequence (RBS). Empty string is RBS. Let s1 and s2 be a RBS then the strings <s1>s2, {s1}s2, [s1]s2, (s1)s2 are also RBS.
For example the string "[[(){}]<>]" is RBS, but the strings "[)()" and "][()()" are not.
Determine the least number of replaces to make the string s RBS.
Input
The only line contains a non empty string s, consisting of only opening and closing brackets of four kinds. The length of s does not exceed 106.
Output
If it's impossible to get RBS from s print Impossible.
Otherwise print the least number of replaces needed to get RBS from s.
Sample Input
[<}){}
2
{()}[]
0
]]
Impossible
给出一串有括号组成的字符串,问有多少对括号不同:
用栈来求解;
将左括号存入栈中,碰到右括号时取出栈中括号配对
#include<stdio.h> #include<string.h> #include<stack> using namespace std; int judge(char a,char b) { if(a=='('&&b==')'||a=='{'&&b=='}'||a=='['&&b==']'||a=='<'&&b=='>') return 1; else return 0; } int main() {char s[1000000]; stack<char>a;//构建栈 int l,k=1; int sum=0; scanf("%s",s); l=strlen(s); for(int i=0;i<l;i++) { if(s[i]=='('||s[i]=='{'||s[i]=='['||s[i]=='<') a.push(s[i]);//左括号存入栈中 else if(s[i]==')'||s[i]=='}'||s[i]==']'||s[i]=='>') { if(a.empty())//判断是否为空栈 { k=0; break; } else if(judge(a.top(),s[i])==0) { sum++; } a.pop();//配对后删除栈元素 }} if(!a.empty()) k=0; if(k==1) printf("%d\n",sum); else printf("Impossible\n"); }