2192:Zipper
题目链接
方法一:DP
#include<iostream>
#include<cstring>
using namespace std;
char a[210], b[210], c[410];
int dp[210][210];
int lena, lenb, lenc;
int flag;
int main() {
int n, i = 0;
cin >> n;
while (i < n) {
cin >> a >> b >> c;
lena = strlen(a);
lenb = strlen(b);
lenc = strlen(c);
memset(dp, 0, sizeof(dp));
dp[0][0] = 1;
for (int j = 0; j <= lena; j++) {//注意就j<=lena,k<=lenb,这样c数组才能遍历到c[lenc-1]
for (int k = 0; k <=lenb; k++) {
if (a[j] == c[j + k]) {
dp[j + 1][k] = dp[j][k] || dp[j + 1][k];//dp[j+1][k]可来自,(1):j*,k (2)j+1,(k-1)*;打*表示匹配成功
}
if (b[k] == c[j + k]) {
dp[j][k + 1] = dp[j][k] || dp[j][k + 1];
}
}
}
if (dp[lena][lenb] == 1)//dp[lena][lenb]的值表示lena-1,lenb-1都匹配成功
printf("Data set %d: yes\n", i + 1);
else
printf("Data set %d: no\n", i + 1);
i++;
}
return 0;
}
方法二:DFS,但是会超时
#include<iostream>
#include<cstring>
using namespace std;
char a[210], b[210],c[410];
int lena, lenb, lenc;
int flag;
void dp(int x, int y, int k) {
if (k == lenc) {
flag = 1;
return;
}
if (a[x] == c[k])
{
dp(x + 1, y, k + 1);
}
if (b[y] == c[k]) {
dp(x, y + 1, k + 1);
}
return;
}
int main() {
int n,i=0;
cin >> n;
while (i<n) {
cin >> a >> b>>c;
lena = strlen(a);
lenb = strlen(b);
lenc = strlen(c);
flag = 0;
dp(0, 0, 0);
if (flag == 1)
printf("Data set %d: yes\n", i+1);
else
printf("Data set %d: no\n", i+1);
i++;
}
return 0;
}