本文介绍了一个算法问题，探讨如何判断一个字符串是否能由另外两个字符串按原顺序组合而成。通过记忆化搜索的方法解决了这一问题，并提供了完整的代码实现。
Zipper
Time Limit: 2000/1000 MS
(Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 2108 Accepted Submission(s): 752
Problem Description
Given three strings, you are to determine whether the
third string can be formed by combining the characters in the first two
strings. The first two strings can be mixed arbitrarily, but each must stay in
its original order.
For example, consider forming "tcraete" from "cat" and
"tree":
String A: cat
String B: tree
String C: tcraete
As you can see, we can form the third string by alternating characters from the
two strings. As a second example, consider forming "catrtee" from
"cat" and "tree":
String A: cat
String B: tree
String C: catrtee
Finally, notice that it is impossible to form "cttaree" from
"cat" and "tree".
Input
The first line of
input contains a single positive integer from 1 through 1000. It represents the
number of data sets to follow. The processing for each data set is identical.
The data sets appear on the following lines, one data set per line.
For each data set, the line of input consists of three strings, separated by a
single space. All strings are composed of upper and lower case letters only.
The length of the third string is always the sum of the lengths of the first
two strings. The first two strings will have lengths between 1 and 200
characters, inclusive.
Output
For each data set, print:
Data set n: yes
if the third string can be formed from the first two, or
Data set n: no
if it cannot. Of course n should be replaced by the data set number. See the
sample output below for an example.
Sample Input
3
cat tree tcraete
cat tree catrtee
cat tree cttaree
Sample Output
Data set 1: yes
Data set 2: yes
Data set 3: no
记忆化搜索 , 一开始没看出来 , 一直 DP 搞了好久 ……
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
