数据结构5

串

#include<iostream>
#include<string>
using namespace std;
int main(){
    string str1;
    string str2;
    string str3;
    cin>>str1;
    cin>>str2;
    cin>>str3;
    int min1 = str1.size()>str2.size()?str2.size():str1.size(); //记录路人与CC的较小值
    int min2 = str1.size()>str3.size()?str3.size():str1.size();//记录路人与XX的较小值
    int p = 0;
    int q = 0;
    for(int i = min1;i>0;i--){
        string a = str2.substr(0,i);//截取路人长度为i的话
        string b = str1.substr((str1.size()-i),i);//截取CC长度为i的话
        if(a == b){
            p = i;
            break;
        }
        else{
            continue;
        }
    }
    for(int i = min2;i>0;i--){     //同上
        string a = str3.substr(0,i);
        string b = str1.substr((str1.size()-i),i);
        if(a == b){
            q = i;
            break;
        }
        else{
            continue;
        }
    }
    cout<<p<<" "<<q<<endl;
}

#include <bits/stdc++.h>
using namespace std;
 
const int maxn = 100000 + 5;
int Next[maxn];
string text, pattern;
 
void getNext()
{
    int i = 0, j = -1;
    Next[i] = j;
    while(i < pattern.length())
    {
        if(j == -1 || pattern[j] == pattern[i])
            Next[++i] = ++j;
        else
            j = Next[j];
    }
}
 
void kmp()
{
    int i = 0, j = 0;
    while(i < text.size())
    {
        if(j == -1 || text[i] == pattern[j])
        {
            j++;
            i++;
        }
        else
            j = Next[j];
 
        if(j == pattern.length())
        {
            cout << i - j + 1 << endl;
            j = Next[j];
        }
    }
}
 
int main()
{
    ios::sync_with_stdio(false);
    cin >> text >> pattern;
    getNext();
    kmp();
    cout << Next[1];
    for(int i = 2; i <= pattern.size(); i++)
        cout << " " << Next[i];
    cout << endl;
    return 0;
}

#include<iostream>
#include<cstring>
using namespace std;
#define MAX 1000001
void Match(char *pattern, int *match){
    int n = strlen(pattern);
    match[0] = -1;
    for(int i = 1; i < n; i++){
        int last = match[i - 1];
        while(last >= 0 && pattern[last + 1] != pattern[i]) last = match[last];
        if(pattern[last+1] == pattern[i] ) match[i] = last + 1;
        else match[i] = -1;
    }
}
int main() {
    int match[MAX];
    char mystring[MAX], pattern[MAX];
    //scanf("%s",(char *) mystring);
    scanf("%s", mystring);
    int n = strlen(mystring);
    int num;
    scanf("%d", &num);
    while(num--){                     // KMP
        scanf("%s", pattern);
        //scanf("%s", (char *)pattern);
        int m = strlen(pattern);
        Match(pattern, match);
        if(n < m) {printf("Not Found\n"); continue;}
        int s = 0, p = 0;
        while(s < n && p < m){        //s -> mystring  p -> pattern
            if(mystring[s] == pattern[p]){ s++; p++;}
            else if(p > 0) p = match[p - 1] + 1;
            else s++;
        }
        if(p == m){
            printf("%s\n", mystring + s - m);
        }
		else printf("Not Found\n");      
    }
	return 0;
}