搜索模板 - 题目

#3538. 搜索模板

统计

AI Translation — This statement was translated using AI and may contain inaccuracies. Please refer to the original statement if in doubt.

你需要找到一个长度最短的、与给定搜索模板匹配的回文串。回文串是指正读和反读都相同的字符串（空串也是回文串）。模板可以包含小写拉丁字母（对应字符串中相同的字母）、符号 '?'（对应任意一个小写拉丁字母）以及符号 '*'（对应零个或多个任意小写拉丁字母）。

输入格式

第一行包含一个字符串 $s$，即模板字符串。该字符串仅包含小写拉丁字母、符号 '?' 和 '*'。

$1 \le |s| \le 500$

输出格式

你需要输出一行，包含一个与给定模板匹配的长度最短的回文串。该回文串应仅包含小写拉丁字母。如果不存在这样的回文串，请输出 "-1"。如果存在多个满足条件的回文串，你可以输出其中任意一个。

样例

样例输入 1

*ac?ba

样例输出 1

abacaba

样例输入 2

ac?ba

样例输出 2

-1

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0

No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
Do not submit duplicated issues.
Issues must be filed in English or Chinese only.

Active Issues 0

No issues in this category.

Closed/Resolved Issues 0