一个有关如何合并字符串的问题，算法请教怎么实现的思路？

Question

Problem Description
Given three strings a, b and c, your mission is to check whether c is the combine string of a and b.
A string c is said to be the combine string of a and b if and only if c can be broken into two subsequences, when you read them as a string, one equals to a, and the other equals to b.
For example, adebcf'' is a combine string ofabc'' and ``def''.

Input
Input file contains several test cases (no more than 20). Process to the end of file.
Each test case contains three strings a, b and c (the length of each string is between 1 and 2000).

Output
For each test case, print Yes'', if c is a combine string of a and b, otherwise printNo''.

Sample Input
abc
def
adebcf
abc
def
abecdf

Sample Output
Yes
No

Answer 1

https://blog.csdn.net/Sentiment_logos/article/details/78911387