0811 POJ#2192 Zipper

最新推荐文章于 2017-08-27 16:16:05 发布

M_H5211

最新推荐文章于 2017-08-27 16:16:05 发布

阅读量309

点赞数

分类专栏： DP 文章标签：动归动态规划

本文链接：https://blog.csdn.net/M_H5211/article/details/77141399

版权

DP 专栏收录该内容

9 篇文章 0 订阅

订阅专栏

摘要

-给定三个字符串，判断第三个字符串是否是前两个串的有序组合。

原题目（或摘要）

- Zipper

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

题目理解

-设置状态 dp[i][j] 为A，B第 i，j位以后的串是否能构成C的 C[i+j]后的串；最终求的就是dp[0][0];

边界dp[lena][lenb] 为合法;

dp[i][j] = dp[i+1][j]&&(A[i]==C[i+j]) || dp[i][j+1]&&(B[j]==C[i+j])

注意

-递推中注意数据越界的问题

日期

-20170813

附加

代码

 
    
  
#include <cstdio>
#include <algorithm>
#include <iostream>
#include <cstring>
#include <memory.h>
using namespace std;
​
#define MAX 500
​
char A[MAX];
char B[MAX];
char C[MAX];
​
bool dp[MAX][MAX];//-1- notry 1- yes 0- no
int lena,lenb,lenc;
int ptrc;
​
bool solve(){
    for(int i=lena;i>=0;i--){
        for(int j=lenb;j>=0;j--){
            if(dp[i][j]){
                if(i-1>=0 && A[i-1]==C[i+j-1]  ) dp[i-1][j] = true;
                if(j-1>=0 && B[j-1]==C[i+j-1]  ) dp[i][j-1] = true;
            }
        }
    }
}
​
void pre(){
    scanf("%s %s %s",A,B,C);
    lena=strlen(A);
    lenb=strlen(B);
    memset(dp,false,sizeof(dp));
    dp[lena][lenb]=1;
    solve();
}
int main(){
​
    int n;scanf("%d",&n);
    int k=n;
    while(k--){
        pre();
        printf("Data set %d: %s\n",n-k,dp[0][0] ? "yes":"no");
    }
    return 0;
}

开始的时候通过递归的方式没有成功

想了一早上也不知道为啥----

递归的代码

 
bool solve(int i,int j){
    
    if(dp[i][j]!=-1) return dp[i][j];
    if(i>lena||j>lenb) return false;
    
    ptrc=i+j;
    bool w1 = (solve(i+1,j) &&( A[i]==C[ptrc]) );
    bool w2 = (solve(i,j+1) && (B[j]==C[ptrc]) );
​
    dp[i][j]=w1||w2?1:0;
    
    return dp[i][j];
}
​