#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
Boyer-Moore算法(C++实现)
最新推荐文章于 2024-02-28 07:31:58 发布