先用dp[i][j] 表示出区间[i , j] 之间最少还需要多少括号平衡。
dp[i][j] = dp[i+1][j] + 1;即先假设所有的括号都是没有匹配的、
然后在通过k来枚举是否s[ i ]后面是否直接有s[ k ] 与其匹配
设一个path[i][j] 数组,令:
如果 path[i][j] = -1 , 则表示 dp[i][j] 是从dp[i+1][j] 转移来的,说明i位置没有和它匹配的,没有匹配的则需要输出整对括号
如果 t = path[i][j] >0 ,让它表示 i与 t位置匹配,则只需要输出i自己,并递归下去
【代码】
/* ***********************************************
Author :angon
************************************************ */
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <stack>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <time.h>
using namespace std;
#define showtime fprintf(stderr,"time = %.15f\n",clock() / (double)CLOCKS_PER_SEC)
#define lld %I64d
#define REP(i,k,n) for(int i=k;i<n;i++)
#define REPP(i,k,n) for(int i=k;i<=n;i++)
#define scan(d) scanf("%d",&d)
#define scanl(d) scanf("%I64d",&d)
#define scann(n,m) scanf("%d%d",&n,&m)
#define scannl(n,m) scanf("%I64d%I64d",&n,&m)
#define mst(a,k) memset(a,k,sizeof(a))
#define LL long long
#define N 105
#define mod 1000000007
inline int read(){int s=0;char ch=getchar();for(; ch<'0'||ch>'9'; ch=getchar());for(; ch>='0'&&ch<='9'; ch=getchar())s=s*10+ch-'0';return s;}
char s[N];
int dp[N][N],path[N][N];
int b[N];
void print(int i,int j)
{
if(i>=j)
return;
if(path[i][j]==-1 )
{
print(i+1,j);
}
if(path[i][j]>0)
{
b[i] = 1;
b[path[i][j]] = 1;
print(i+1,path[i][j]-1);
print(path[i][j],j);
}
}
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
while(gets(s) != NULL)
{
int n = strlen(s);
REPP(i,0,n) dp[i][i] = 1;
mst(path,-1);
for(int l=1;l<n;l++)
{
for(int i=0;i+l<n;i++)
{
int j = i+l;
dp[i][j] = dp[i+1][j] + 1;
for(int k=i+1;k<=j;k++)
{
if(s[i]=='(' && s[k]==')' || s[i]=='[' && s[k]==']')
{
if(dp[i][j] > dp[i+1][k] + dp[k+1][j] -1)
{
dp[i][j] = dp[i+1][k-1] + dp[k][j] -1;
path[i][j] = k;
// printf("path[%d][%d] = %d\n",i,j,path[i][j]);
}
}
//printf("dp[%d][%d] = %d dp[%d][%d] = %d dp[%d][%d] = %d\n",i+1,k,dp[i+1][k],k+1,j,dp[k+1][j],i,j,dp[i][j]);
}
}
}
mst(b,0);
print(0,n-1);
REP(i,0,n)
{
if(b[i])
putchar(s[i]);
else
{
if(s[i] == '(' || s[i] == ')')
printf("()");
else
printf("[]");
}
}
puts("");
}
return 0;
}