zoukankan      html  css  js  c++  java
  • Simpsons’ Hidden Talents

    Homer: Marge, I just figured out a way to discover some of the talents we weren’t aware we had. 
    Marge: Yeah, what is it? 
    Homer: Take me for example. I want to find out if I have a talent in politics, OK? 
    Marge: OK. 
    Homer: So I take some politician’s name, say Clinton, and try to find the length of the longest prefix 
    in Clinton’s name that is a suffix in my name. That’s how close I am to being a politician like Clinton 
    Marge: Why on earth choose the longest prefix that is a suffix??? 
    Homer: Well, our talents are deeply hidden within ourselves, Marge. 
    Marge: So how close are you? 
    Homer: 0! 
    Marge: I’m not surprised. 
    Homer: But you know, you must have some real math talent hidden deep in you. 
    Marge: How come? 
    Homer: Riemann and Marjorie gives 3!!! 
    Marge: Who the heck is Riemann? 
    Homer: Never mind. 
    Write a program that, when given strings s1 and s2, finds the longest prefix of s1 that is a suffix of s2.

    InputInput consists of two lines. The first line contains s1 and the second line contains s2. You may assume all letters are in lowercase.OutputOutput consists of a single line that contains the longest string that is a prefix of s1 and a suffix of s2, followed by the length of that prefix. If the longest such string is the empty string, then the output should be 0. 
    The lengths of s1 and s2 will be at most 50000.Sample Input

    clinton
    homer
    riemann
    marjorie

    Sample Output

    0
    rie 3
    思路:连接连个字符串求next数组。注意next数组的值不能超过len1或者len2
    #include <iostream>
    #include<string.h>
    using namespace std;
    const int maxn = 50010,maxn2=2*maxn;
    char a[maxn],b[maxn],c[maxn2];
    int ne[maxn2];
    int main()
    {
        while(scanf("%s",a+1)!=EOF)
        {
            scanf("%s",b+1);
            int len1=strlen(a+1),len2=strlen(b+1);
            int num=1;
            for(int i=1;i<=len1;i++)
            {
                c[num]=a[i];
                num++;
            }
            for(int i=1;i<=len2;i++)
            {
                c[num]=b[i];
                num++;
            }
            num--;
            for(int i=2,j=0;i<=num;i++)
            {
                while(j&&c[i]!=c[j+1]) j=ne[j];
                if(c[i]==c[j+1]) j++;
                ne[i]=j;
            }
            if(ne[num]==0)
                printf("0
    ");
            else
            {
                int ans=ne[num];
                if(ans>len1) ans=len1;
                if(ans>len2) ans=len2;
                for(int i=1;i<=ans;i++)
                printf("%c",a[i]);
            printf(" %d
    ",ans);
            }
        }
        return 0;
    }
  • 相关阅读:
    2019-2020-1 20175201 20175215 20175229实验五 通讯协议设计
    2019-2020-1 20175201 20175215 20175229实验四 外设驱动程序设计
    2019-2020-1 实验三-并发程序 20175215
    20175201 20175215 20175229 实验二 固件程序设计
    冲刺博客汇总
    2018-2019-2 20175215 实验五《网络编程与安全》实验报告
    Int和Integer(课上测试)
    MySort(选做)
    2019-2020-2 20175234 赵诗玥 《网络对抗技术》 Exp1 PC平台逆向破解
    2019-2020-2 20175234 赵诗玥《网络对抗技术》 Exp0 Kali安装
  • 原文地址:https://www.cnblogs.com/wjc2021/p/11309634.html
Copyright © 2011-2022 走看看