077day（动态规划题（Zipper）的尝试）

172210704111-陈国佳总结《2017年12月27日》【连续077天】

标题：动态规划题（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 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.
输出
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.
样例输入
3
cat tree tcraete
cat tree catrtee
cat tree cttaree
样例输出
Data set 1: yes
Data set 2: yes
Data set 3: no

这道题按照我的理解，为给两个字符串，按它们字母的顺序，看能否组成第三个字符串；

其中，1<N<1000,两个字符串不超过200个字母；

这道题我暂时还未解出来，先给一下错误代码：

const int Num=200;
	int N,aL,bL;
	cin>>N;
	char a[Num],b[Num],c[2*Num],mn;
	for(int i=1;i<=N;++i){
		 memset(a,0,sizeof(a));
		 memset(b,0,sizeof(b));
		 memset(c,0,sizeof(c));
		 if(mn=(cin.peek())=='\n')cin.ignore(1);
		 cin.getline(a,Num,' ');
		 cin.getline(b,Num,' ');
		 cin.getline(c,2*Num,'\n'); 
		 aL=strlen(a)-1;
		 bL=strlen(b)-1;
		 int t=0,m=0,n=0;
		 while(m<=aL||n<=bL){
		    	if(a[m]!=c[t]&&b[n]!=c[t])break;
		    	while(a[m]==c[t])++m,++t;
		    	while(b[n]==c[t])++n,++t;
		    }
		m--,n--;
		if(m!=aL||n!=bL)cout<<"Data set "<<i<<": no"<<endl;
		else cout<<"Data set "<<i<<": yes"<<endl;

由于先想着解出来，有很多地方过于繁琐；

这里记一下几个收获：

1）cin读入时，遇到'\n'后，不会把它从输入流中取走，所以如果后接getline,得到的第一个字符就是'\n'，因此我用cin.ignore把'\n'从输入流中取走，为了保险，加了一个判断；

2）当一个循环结束后，要记得把a,b,c清零，否则后面输入的字符串如果小于前面的，可能无法覆盖，造成结果出错；

这里最大的收获是对调试功能的反复训练；

明日计划：备考；