超级会员免费看
该博客讨论了一道编程题，涉及动态规划。题目要求判断能否通过两个给定字符串的字符交替组合形成第三个字符串。博客提到了关键在于检查两个原始字符串是否为目标字符串的非连续子串，并给出了相关示例和解题思路。
002:Zipper
总时间限制: 1000ms 内存限制: 65536kB
描述
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”.
输入
The first line of input contain
订阅专栏 解锁全文
扫一扫
482
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
