Java实现算法之Brackets Sequence问题

最新推荐文章于 2022-08-16 15:50:48 发布

NFMSR

最新推荐文章于 2022-08-16 15:50:48 发布

阅读量443

点赞数

分类专栏：算法文章标签： java 算法 Brackets Sequence 动态规划 DP

本文链接：https://blog.csdn.net/NFMSR/article/details/78566003

版权

本文探讨了使用Java解决Brackets Sequence问题的动态规划方法，包括问题描述、输入输出、思路分析及代码实现。在分析过程中，作者发现对于某些特定情况，动态规划可能不是最佳解决方案，提出了可能更适合使用栈来处理该问题。

摘要由CSDN通过智能技术生成

Problem：

Description

Let us define a regular brackets sequence in the following way:

1. Empty sequence is a regular sequence.
2. If S is a regular sequence, then (S) and [S] are both regular sequences.
3. 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 e