#include<iostream>
using namespace std;
#define MaxNumber 100
char *Number = new char[MaxNumber];
char *C = new char[MaxNumber];
void found(char data[], char number[], int a, int b) {
bool out = false;
int c = 0;
while (!out)
{
for (int i = 0; i < c ; i++) {
cout << " ";
}
for (int i = 0; i <b ; i++) {
cout <<number[i];
}
cout << endl;
for (int i = b - 1; i >= 0; i--)
{
if (number[i] != data[c + i]) {
if (i != b - 1) {
bool d = true;
for (int j = b-2; j >=0; j--)
{
if (data[c + i] == number[j]) {
c += b - j - 1;
d = false;
if (c > a) {
cout << "------------------------" << endl;
cout << " 找不到这个字符串" << endl;
}
break;
}
}
if (d) {
for (int j = b-2; j >=0; j--)
{
if (data[c + b - 1] == number[j]) {
c += b - j - 1;
if (c > a) {
cout << "------------------------" << endl;
cout << " 找不到这个字符串" << endl;
}
break;
}
if (j == 0) {
c += b;
if (c > a) {
cout << "------------------------" << endl;
cout << " 找不到这个字符串" << endl;
}
break;
}
}
}
}
else {
for (int j = b - 2; j >= 0; j--)
{
if (data[c + i] == number[j]) {
c += b - j - 1;
if (c > a) {
cout << "------------------------" << endl;
cout << " 找不到这个字符串" << endl;
}
break;
}
if (j == 0) {
c += b;
if (c > a) {
cout << "------------------------" << endl;
cout << " 找不到这个字符串" << endl;
}
break;
}
}
}
if (c > a) {
out = true;
}
else {
out = false;
}
break;
}
if (i == 0) {
out = true;
cout << "找到了这个字符串" << endl;
}
}
}
}
int main() {
int length;
cout << "输入字符数组长度:";
cin >> length;
cout << endl;
cout << "输入字符数组:";
for (int i = 0; i < length; i++)
{
cin >> Number[i];
}
cout << endl;
cout << "输入字符串长度:";
int NumberLength;
cin >> NumberLength;
cout << endl;
cout << "输入字符串:";
for (int i = 0; i < NumberLength; i++)
{
cin >> C[i];
}
cout << "------------------------" << endl;
cout << " 数据录入完毕 " << endl;
cout << "------------------------" << endl;
for (int i = 0; i < length; i++)
{
cout<< Number[i];
}
cout << endl;
found(Number, C, length, NumberLength);
return 0;
}
Boyer-Moore算法(C++实现)
最新推荐文章于 2024-02-28 07:31:58 发布