给定一组括号字符，任务是找到包含这些字符的最短正规括号序列。正规括号序列定义为空序列、括号包裹的正规序列、两个正规序列的连接。输出应包含输入作为子序列的最短正规括号序列。
Let us define a regular brackets sequence in the following way:
-
Empty sequence is a regular sequence.
-
If S is a regular sequence, then (S) and [S] are both regular sequences.
-
If A and B are regular sequences, then AB is a regular sequence.
For example, all of the following sequences of characters are regular brackets sequences:
(), [], (()), ([]), ()[], ()[()]
And all of the following character sequences are not:
(, [, ), )(, ([)], ([(]
Some sequence of characters ‘(’, ‘)’, ‘[’, and ‘]’ is given. You are to find the shortest possible regular brackets sequence, that contains the given character sequence as a subsequence. Here, a string a1 a2 … an is called a subsequence of the string b1 b2 … bm, if there exist such indices 1 = i1 < i2 < … < in = m, that aj = bij for all 1 = j = n.
Input
The input file contains at most 100 brackets (characters ‘(’, ‘)’, ‘[’
最低0.47元/天 解锁文章
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
