1010. Zipper

原创 2015年11月21日 10:47:09

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
Copy sample input to clipboard
3
cat tree tcraete
cat tree catrtee
cat tree cttaree
Sample Output
Data set 1: yes
Data set 2: yes
Data set 3: no

CPP

#include <iostream>
#include <string>
#include <cstring>
using namespace std;

const int N = 205;

string a, b, c;
bool dp[N][N];

int main()
{
    int cases;
    int num = 0;

    cin >> cases;

    while (cases--)
    {
        num++;
        cin >> a >> b >> c;

        memset(dp, false, sizeof(dp));

        dp[0][0] = true;

        for (int i = 0; i < b.size(); i++)
            if (b[i] == c[i])
                dp[0][i+1] = true;//
            else
                break;

        for (int i = 0; i < a.size(); i++)
            if (a[i] == c[i])
                dp[i+1][0] = true;
            else
                break;
        //确定c最初几个字母的归属
        for (int i = 1; i <= a.size(); i++)
            for (int j = 1; j <= b.size(); j++)
                dp[i][j] = (dp[i-1][j] && c[i+j-1] == a[i-1]) || (dp[i][j-1] && c[i+j-1] == b[j-1]);
        //通过二维数组来确定
        //判断条件需学会!
        if (dp[a.size()][b.size()])
            cout << "Data set "<< num << ": yes" << endl;
        else
            cout << "Data set "<< num << ": no" << endl;
    }
    return 0;
}

C (有未知bug!)

#include <stdio.h>
#include <string.h>
int main() {
    int n;
    scanf("%d", &n);
    int k;
    for (k = 1; k <= n; k++) {
        char a[200], b[200], c[200];
        scanf("%s%s%s", a, b, c);
        int dp[200][200];
        memset(dp, 0, sizeof(dp));
        dp[0][0] = 1;
        for (int i = 0; i < strlen(b); i++) {
            if (b[i] == c[i]) {
                dp[0][i + 1] = 1;
            } else {
                break;
            }
        }
        for (int i = 0; i < strlen(a); i++) {
            if (a[i] == c[i]) {
                dp[i + 1][0] = 1;
            } else {
                break;
            }
        }
        for (int i = 1;i <= strlen(a); i++) {
            for (int j = 1; j <= strlen(b); j++) {
                dp[i][j] = (dp[i - 1][j] && c[i + j - 1] == a[i - 1]) || (dp[i][j - 1] && c[i + j - 1] == b[j - 1]);
            }
        }
        if (dp[strlen(a)][strlen(b)]) {
            printf("Data set %d: yes\n", k);
        } else {
            printf("Data set %d: no\n", k);
        }
    }
    return 0;
}

此题是通过定义一个二维数组,前一个变量确定a后一个变量确定b
判断条件尤其重要!!

版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/stary_yan/article/details/49962599

1010. Zipper

TAG   动态规划 dp 使3个字符串A B Cdp[i][j]表示A的前i个字符和B的前j个字符能否组合成C的前i+j个字符状态转移方程: dp[i][j]=    dp[i-1][j] && C...
  • Dinosoft
  • Dinosoft
  • 2010-07-10 00:53:00
  • 1481

Sicily 1010. Zipper 尾递归

Given three strings, you are to determine whether the third string can be formed by combining the ch...
  • qq_23136451
  • qq_23136451
  • 2014-12-21 16:19:54
  • 200

Sicily 1010. Zipper

1010. Zipper Constraints Time Limit: 1 secs, Memory Limit: 32 MB Description Given thr...
  • u012925008
  • u012925008
  • 2015-03-21 09:09:18
  • 363

1010. Zipper (dp)

soj.me/1010 dp[i][j]=    dp[i-1][j] && C[i+j-1]==A[i-1]    ||      dp[i][j-1] && C[i+j-1]==B[j-1]; ...
  • luojiayu14
  • luojiayu14
  • 2012-02-24 20:08:14
  • 513

[sicily online]1010. Zipper

Constraints Time Limit: 1 secs, Memory Limit: 32 MB Description Given three strings, you ar...
  • qiuchenl
  • qiuchenl
  • 2012-12-07 10:29:00
  • 561

Zipper中国区技术顾问张健:Zip要如何改变Ripple?

来源:三点钟无眠区块链社群蔡文胜:现在我请Zipper几位主创和大家分享zip要如何改变ripple,供大家参考。张健,原来火币CTO和熊科淼一直做银行结算账户系统,是zipper主创。熊科淼:Zip...
  • q1ZG4Sw
  • q1ZG4Sw
  • 2018-02-19 00:00:00
  • 225

pat1010Radix (25)

题意分析: (1)给出两个正整数,给出其中一个正整数的基底,求另外一个正整数的基底,使得这两个正整数在各自的基底的十进制数相等 (2)先求出给出基底的那个正整数在十进制下的值,求另外一个数的基底,很容...
  • LostStephon
  • LostStephon
  • 2015-10-02 17:34:50
  • 621

算法题:Zipper

题目: 给定三个字符串,A,B,C。A和B的长度和等于C。判断字符串C能否由字符串A、B中的字符组成。要求,原来A 和 B 中的字符作为C中的字符时,还必须保持字符在原串中的顺序。 例如: ...
  • simplelovecs
  • simplelovecs
  • 2016-04-26 17:30:03
  • 346

PAT 1010 Radix (25)

先看题目: 这个题目算是比较DT,花了很长时间,提交次数很多,每次都会有测试点没通过,后来网上搜索了一下,有一些特俗边界条件被我们忽略。 1,首先求目标数据进制,这个进制在任何条件...
  • baidu_25107219
  • baidu_25107219
  • 2015-06-30 22:01:13
  • 726

POJ2192:Zipper(DP)

Description Given three strings, you are to determine whether the third string can be formed by com...
  • libin56842
  • libin56842
  • 2013-12-15 19:37:34
  • 2393
收藏助手
不良信息举报
您举报文章:1010. Zipper
举报原因:
原因补充:

(最多只允许输入30个字)