#动态规划简单求解 s=input() lenth=len(s) dp=[[0]*lenth for _ in range(lenth) ] def match(a,b): if a=='(' and b==')':return True if a=='[' and b==']':return True return False for i in range(len(dp)):#初始化区间长度为1时最少插入次数为1 dp[i][i]=1 for part_len in range(2,lenth+1): for i in range(lenth-part...