poj2192——Zipper（动态规划）

最新推荐文章于 2019-01-08 01:55:02 发布

原创最新推荐文章于 2019-01-08 01:55:02 发布 · 562 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

动态规划专栏收录该内容

60 篇文章

订阅专栏

本文介绍了一个经典的字符串问题：如何判断第三个字符串是否能由前两个字符串的字符按原顺序组合而成。通过动态规划的方法解决了这一问题，并给出了完整的C++实现代码。

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

这道题大一就见过，一直想搞清楚到底怎么AC它。学了动规才体会到它的精妙之处

#include<iostream>
#include<cstdio>
#include<cstring>
#define MAXN 1000010
using namespace std;
char a[1500],b[1500],c[1500],dp[500][500];
int main()
{
    int n,i,j,cnt=1,la,lb;
    scanf("%d",&n);
    while(n--)
    {
        scanf("%s %s %s",a+1,b+1,c+1);
        memset(dp,0,sizeof(dp));
        la=strlen(a+1);
        lb=strlen(b+1);
        for(i=1; i<=la; ++i)  //并不是只有dp[1][0]=1这么简单
        {
            if(c[i]==a[i])
                dp[i][0]=1;
            else
                break;
        }
        for(i=1; i<=lb; ++i)
        {
            if(c[i]==b[i])
                dp[0][i]=1;
            else
                break;
        }
        for(i=1; i<=la; ++i)
            for(j=1; j<=lb; ++j)
            {
                if(a[i]==c[i+j]&&dp[i-1][j])   
                    dp[i][j]=1;
                if(b[j]==c[i+j]&&dp[i][j-1])
                    dp[i][j]=1;
            }
        if(dp[la][lb])
            printf("Data set %d: yes\n",cnt++);
        else
            printf("Data set %d: no\n",cnt++);
    }
    return 0;
}