要求完成如下实验:
实验1,顺序串的基本操作
实验2,链串的基本操作
实验3,KMP算法
在结果中输出你的姓名和学号和完成时间。
实验1:实现顺序串的各种基本运算的算法
目的:领会顺序串存储结构和掌握顺序串中各种基本运算算法的设计。
内容:编写一个程序 sqstring. cpp,实现顺序串的各种基本运算,并在此基础上设计一个程序exp4-1.cpp完成以下功能。
(1)建立串 s="abcdefghijklmn" 和串 s1="xyz"。
(2)输出串s。
(3)输出串s的长度。
(4)在串s的第9个字符的位置插入串s1而产生串s2。
(5)输出串s2。
(6)删除串s从第2个字符开始的5个字符而产生串s2。
(7)输出串s2。
(8)将串s从第2个字符开始的5个字符替换成串s1而产生串s2。
(9)输出串s2。
(10)提取串s从第2个字符开始的10个字符而产生串s3。
(11)输出串s3。
(12)将串s1和串s2连接起来而产生串s4。
(13)输出串s4。
代码实现如下:
#define _CRT_SECURE_NO_WARNINGS 1
#include <stdio.h>
#include <string.h>
#include <ctime>
#define MaxSize 100
typedef struct
{
char data[MaxSize];
int length;
}SqString;
//1.生成串,并赋值
void StrAssign(SqString& s, char cstr[])
{
int i;
for (i = 0; cstr[i] != '\0'; i++)
s.data[i] = cstr[i];
s.length = i;
}
//2.销毁串
void DestroyStr(SqString& s)
{
}
//3.串的复制
void StrCopy(SqString& s, SqString t)
{
int i;
for (i = 0; i < t.length; i++)
s.data[i] = t.data[i];
s.length = t.length;
}
//4.判断串是否相等
bool StrEqual(SqString s, SqString t)
{
bool same = true;
if (s.length != t.length)
same = false;
else
for (int i = 0; i < s.length; i++)
if (s.data[i] != t.data[i])
{
same = false;
break;
}
return same;
}
//5.求串长
int StrLength(SqString s)
{
return s.length;
}
//6.串连接
SqString Concat(SqString s, SqString t)
{
SqString str;
int i;
str.length = s.length + t.length;
for (i = 0; i < s.length; i++)
str.data[i] = s.data[i];
for (i = 0; i < t.length; i++)
str.data[s.length + i] = t.data[i];
return str;
}
//7.插入串
SqString InsStr(SqString s1, int i, SqString s2)
{
int j;
SqString str;
str.length = 0;
if (i <= 0 || i > s1.length + 1)
return str;
for (j = 0; j < i - 1; j++)
str.data[j] = s1.data[j];
for (j = 0; j < s2.length; j++)
str.data[i + j - 1] = s2.data[j];
for (j = i - 1; j < s1.length; j++)
str.data[s2.length + j] = s1.data[j];
str.length = s1.length + s2.length;
return str;
}
//8.删除子串
SqString DelStr(SqString s, int i, int j)
{
int k;
SqString str;
str.length = 0;
if (i <= 0 || i > s.length || i + j - 1 > s.length)
return str;
for (k = 0; k < i - 1; k++)
str.data[k] = s.data[k];
for (k = j + i - 1; k < s.length; k++)
str.data[k - j] = s.data[k];
str.length = s.length - j;
return str;
}
//9.子串的替换
SqString InsStr(SqString s, int i, int j, SqString t)
{
int k;
SqString str;
str.length = 0;
if (i <= 0 || i > s.length || i + j - 1 > s.length)
return str;
for (k = 0; k < i - 1; k++)
str.data[k] = s.data[k];
for (k = 0; k < t.length; k++)
str.data[i + k - 1] = t.data[k];
for (k = j + i - 1; k < s.length; k++)
str.data[k - j + t.length] = s.data[k];
str.length = s.length - j + t.length;
return str;
}
//10.输出串
void DispStr(SqString s)
{
int i;
if (s.length > 0)
{
for (i = 0; i < s.length; i++)
printf("%c", s.data[i]);
printf("\n");
}
}
//11.求子串
SqString SubStr(SqString s, int i, int j)
{
int k;
SqString str;
str.length = 0;
if (i<-0 || i>s.length || j<0 || i + j - 1>s.length)
return str;
for (k = i - 1; k < i + j - 1; k++)
str.data[k - i + 1] = s.data[k];
str.length = j;
return str;
}
int main() {
SqString s, s1;
printf("学号:\t\t\t姓名:\n");
time_t nowtime;
time(&nowtime);
tm* p = localtime(&nowtime);
printf("日期:%04d-%02d-%02d\t时间:%02d:%02d:%02d\n", p->tm_year + 1900,
p->tm_mon + 1, p->tm_mday, p->tm_hour, p->tm_min, p->tm_sec);
printf("\n");
printf("(1)建立串s,s1\n");
char cstr[] = "abcdefghijklmn";
char cstr1[] = "xyz";
StrAssign(s, cstr);
StrAssign(s1, cstr1);
printf("(2)输出串s:");
DispStr(s);
printf("\n");
printf("(3)输出串s的长度:");
StrLength(s);
printf("%d", StrLength(s));
printf("\n");
printf("(4)在串s的第9个字符位置插入s1而产生s2\n");
SqString s2;
s2 = InsStr(s, 9, s1);
printf("(5)输出串s2:");
DispStr(s2);
printf("\n");
printf("(6)删除串s的第2个字符开始的5个字符而产生的s2");
s2 = DelStr(s, 2, 5);
printf("\n");
printf("(7)输出串s2:");
DispStr(s2);
printf("\n");
printf("(8)将串s的第二个字符开始的5个字符替换成s1而产生s2");
s2 = InsStr(s, 2, 5, s1);
printf("\n");
printf("(9)输出串s2:");
DispStr(s2);
printf("\n");
printf("(10)提取串s的第2个字符开始的10个字符而产生串s3");
SqString s3;
s3 = SubStr(s, 2, 10);
printf("\n");
printf("(11)输出串s3:");
DispStr(s3);
printf("\n");
printf("(12)将串s1与s2连接起来产生串s4");
SqString s4;
s4 = Concat(s1, s2);
printf("\n");
printf("(13)输出串s4:");
DispStr(s4);
printf("\n");
return 0;
}
运行结果如下图所示:
实验题2:实现链串的各种基本运算的算法
目的:领会链串存储结构和掌握链串中各种基本运算算法的设计。
内容:编写一个程序listring. cpp,实现链串的各种基本运算,并在此基础上设程序exp4-2. cpp完成以下功能。
(1)建立串 s="abcdefghijklmn" 和串 s1="xyz"。
(2)输出串s。
(3)输出串s的长度。
(4)在串s的第9个字符的位置插入串s1而产生串s2。
(5)输出串s2。
(6)删除串s从第2个字符开始的5个字符而产生串s2。
(7)输出串s2。
(8)将串s从第2个字符开始的5个字符替换成串s1而产生串s2。
(9)输出串s2。
(10)提取串s从第2个字符开始的10个字符而产生串s3。
(11)输出串s3。
(12)将串s1和串s2连接起来而产生串s4。
(13)输出串s4。
代码实现如下:
#define _CRT_SECURE_NO_WARNINGS 1
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <ctime>
#define MaxSize 100
typedef struct snode
{
char data;
struct snode* next;
}LinkStrNode;
//1.生成串并赋值
void StrAssign(LinkStrNode*& s, char cstr[])
{
int i;
LinkStrNode* r, * p;
s = (LinkStrNode*)malloc(sizeof(LinkStrNode));
r = s;
for (i = 0; cstr[i] != '\0'; i++)
{
p = (LinkStrNode*)malloc(sizeof(LinkStrNode));
p->data = cstr[i];
r->next = p;
r = p;
}
r->next = NULL;
}
//2.销毁串
void DestroyStr(LinkStrNode*& s)
{
LinkStrNode* pre = s, * p = s->next;
while (p != NULL)
{
free(pre);
pre = p;
p = p->next;
}
free(pre);
}
//3.串的复制
void StrCopy(LinkStrNode*& s, LinkStrNode* t)
{
LinkStrNode* p = t->next, * q, * r;
s = (LinkStrNode*)malloc(sizeof(LinkStrNode));
r = s;
while (p != NULL)
{
q = (LinkStrNode*)malloc(sizeof(LinkStrNode));
q->data = p->data;
r->next = q;
r = q;
p = p->next;
}
r->next = NULL;
}
//4.判断串相等
bool StrEqual(LinkStrNode* s, LinkStrNode* t)
{
LinkStrNode* p = s->next, * q = t->next;
while (p != NULL && q != NULL && p->data == q->data)
{
p = p->next;
q = q->next;
}
if (p == NULL && q == NULL)
return true;
else
return false;
}
//5.求串长
int StrLength(LinkStrNode* s)
{
LinkStrNode* p = s->next;
int count = 0;
while (p != NULL)
{
count++;
p = p->next;
}
return count;
}
//6.串的连接
LinkStrNode* Concat(LinkStrNode* s, LinkStrNode* t)
{
LinkStrNode* str, * p = s->next, * q, * r;
str = (LinkStrNode*)malloc(sizeof(LinkStrNode));
r = str;
while (p != NULL)
{
q = (LinkStrNode*)malloc(sizeof(LinkStrNode));
q->data = p->data;
r->next = q;
r = q;
p = p->next;
}
p = t->next;
while (p != NULL)
{
q = (LinkStrNode*)malloc(sizeof(LinkStrNode));
q->data = p->data;
r->next = q;
r = q;
p = p->next;
}
r->next = NULL;
return str;
}
//7.求子串
LinkStrNode* SubStr(LinkStrNode* s, int i, int j)
{
int k;
LinkStrNode* str, * p = s->next, * q, * r;
str = (LinkStrNode*)malloc(sizeof(LinkStrNode));
str->next = NULL;
r = str;
if (i <= 0 || i > StrLength(s) || j<0 || i + j - 1>StrLength(s))
return str;
for (k = 1; k < i; k++)
p = p->next;
for (k = 1; k <= j; k++)
{
q = (LinkStrNode*)malloc(sizeof(LinkStrNode));
q->data = p->data;
r->next = q;
r = q;
p = p->next;
}
r->next = NULL;
return str;
}
//8.子串的插入
LinkStrNode* InsStr(LinkStrNode* s, int i, LinkStrNode* t)
{
int k;
LinkStrNode* str, * p = s->next, * p1 = t->next, * q, * r;
str = (LinkStrNode*)malloc(sizeof(LinkStrNode));
str->next = NULL;
r = str;
if (i <= 0 || i > StrLength(s) + 1)
{
return str;
}
for (k = 1; k < i; k++)
{
q = (LinkStrNode*)malloc(sizeof(LinkStrNode));
q->data = p->data;
r->next = q;
r = q;
p = p->next;
}
while (p1 != NULL)
{
q = (LinkStrNode*)malloc(sizeof(LinkStrNode));
q->data = p1->data;
r->next = q;
r = q;
p1 = p1->next;
}
while (p != NULL)
{
q = (LinkStrNode*)malloc(sizeof(LinkStrNode));
q->data = p->data;
r->next = q;
r = q;
p = p->next;
}
r->next = NULL;
return str;
}
//9.子串的删除
LinkStrNode* DelStr(LinkStrNode* s, int i, int j)
{
int k;
LinkStrNode* str, * p = s->next, * q, * r;
str = (LinkStrNode*)malloc(sizeof(LinkStrNode));
str->next = NULL;
r = str;
if (i <= 0 || i > StrLength(s) || j<0 || i + j - 1>StrLength(s))
return str;
for (k = 1; k < i; k++)
{
q = (LinkStrNode*)malloc(sizeof(LinkStrNode));
q->data = p->data;
r->next = q;
r = q;
p = p->next;
}
for (k = 0; k < j; k++)
p = p->next;
while (p != NULL)
{
q = (LinkStrNode*)malloc(sizeof(LinkStrNode));
q->data = p->data;
r->next = q;
r = q;
p = p->next;
}
r->next = NULL;
return str;
}
//10.子串的替换
LinkStrNode* InsStr(LinkStrNode* s, int i, int j, LinkStrNode* t)
{
int k;
LinkStrNode* str, * p = s->next, * p1 = t->next, * q, * r;
str = (LinkStrNode*)malloc(sizeof(LinkStrNode));
str->next = NULL;
r = str;
if (i <= 0 || i > StrLength(s) || j<0 || i + j - 1>StrLength(s))
return str;
for (k = 1; k < i - 1; k++)
{
q = (LinkStrNode*)malloc(sizeof(LinkStrNode));
q->data = p->data;
r->next = q;
r = q;
p = p->next;
}
for (k = 0; k < j; k++)
p = p->next;
while (p1 != NULL)
{
q = (LinkStrNode*)malloc(sizeof(LinkStrNode));
q->data = p1->data;
r->next = q;
r = q;
p1 = p1->next;
}
while (p != NULL)
{
q = (LinkStrNode*)malloc(sizeof(LinkStrNode));
q->data = p->data;
r->next = q;
r = q;
p = p->next;
}
r->next = NULL;
return str;
}
//11.输出串
void DispStr(LinkStrNode* s)
{
LinkStrNode* p = s->next;
while (p != NULL)
{
printf("%c", p->data);
p = p->next;
}
printf("\n");
}
int main() {
LinkStrNode* s, * s1;
printf("学号:\t\t\t姓名:\n");
time_t nowtime;
time(&nowtime);
tm* p = localtime(&nowtime);
printf("日期:%04d-%02d-%02d\t时间:%02d:%02d:%02d\n", p->tm_year + 1900,
p->tm_mon + 1, p->tm_mday, p->tm_hour, p->tm_min, p->tm_sec);
printf("\n");
printf("(1)建立串s,s1\n");
char cstr[] = "abcdefghijklmn";
char cstr1[] = "xyz";
StrAssign(s, cstr);
StrAssign(s1, cstr1);
printf("\n");
printf("(2)输出串s:");
DispStr(s);
printf("\n");
printf("(3)输出串s的长度:");
StrLength(s);
printf("%d", StrLength(s));
printf("\n");
printf("(4)在串s的第9个字符位置插入s1而产生s2");
LinkStrNode* s2;
s2 = InsStr(s, 9, s1);
printf("\n");
printf("(5)输出串s2:");
DispStr(s2);
printf("\n");
printf("(6)删除串s的第2个字符开始的5个字符而产生的s2");
s2 = DelStr(s, 2, 5);
printf("\n");
printf("(7)输出串s2:");
DispStr(s2);
printf("\n");
printf("(8)将串s的第二个字符开始的5个字符替换成s1而产生s2");
s2 = InsStr(s, 2, 5, s1);
printf("\n");
printf("(9)输出串s2:");
DispStr(s2);
printf("\n");
printf("(10)提取串s的第2个字符开始的10个字符而产生串s3");
LinkStrNode* s3;
s3 = SubStr(s, 2, 10);
printf("\n");
printf("(11)输出串s3:");
DispStr(s3);
printf("\n");
printf("(12)将串s1与s2连接起来产生串s4");
LinkStrNode* s4;
s4 = Concat(s1, s2);
printf("\n");
printf("(13)输出串s4:");
DispStr(s4);
printf("\n");
return 0;
}
运行结果如下图所示:
实验题3:实现顺序串的各种模式匹配算法
目的:掌握串的模式匹配算法(即BF和KMP算法)设计。
内容:编写一个程序exp4-3.cpp,实现顺序串的各种模式匹配运算,并在此基础上完成以下功能。
(1)建立目标串 s="abcabcdabcdeabcdefabcdefg" 和模式串t="abcdeabcdefab"。
(2)采用简单匹配算法求t在s中的位置。
(3)由模式串t求出next数组值和nextval数组值。
(4)采用KMP算法求t在s中的位置。
(5)采用改进的KMP算法求t在s中的位置。
代码实现如下:
#define _CRT_SECURE_NO_WARNINGS 1
#define _CRT_SECURE_NO_WARNINGS 1
#include <stdio.h>
#include <ctime>
#include <stdlib.h>
#include <string.h>
#define MaxSize 100
typedef struct
{
char data[MaxSize];
int length;
}SqString;
//以下与第一个实验中的顺序串算法一致
//1.生成串,并赋值
void StrAssign(SqString& s, char cstr[])
{
int i;
for (i = 0; cstr[i] != '\0'; i++)
s.data[i] = cstr[i];
s.length = i;
}
//2.销毁串
void DestroyStr(SqString& s)
{
}
//3.串的复制
void StrCopy(SqString& s, SqString t)
{
int i;
for (i = 0; i < t.length; i++)
s.data[i] = t.data[i];
s.length = t.length;
}
//4.判断串是否相等
bool StrEqual(SqString s, SqString t)
{
bool same = true;
if (s.length != t.length)
same = false;
else
for (int i = 0; i < s.length; i++)
if (s.data[i] != t.data[i])
{
same = false;
break;
}
return same;
}
//5.求串长
int StrLength(SqString s)
{
return s.length;
}
//6.串连接
SqString Concat(SqString s, SqString t)
{
SqString str;
int i;
str.length = s.length + t.length;
for (i = 0; i < s.length; i++)
str.data[i] = s.data[i];
for (i = 0; i < t.length; i++)
str.data[s.length + i] = t.data[i];
return str;
}
//7.插入串
SqString InsStr(SqString s1, int i, SqString s2)
{
int j;
SqString str;
str.length = 0;
if (i <= 0 || i > s1.length + 1)
return str;
for (j = 0; j < i - 1; j++)
str.data[j] = s1.data[j];
for (j = 0; j < s2.length; j++)
str.data[i + j - 1] = s2.data[j];
for (j = i - 1; j < s1.length; j++)
str.data[s2.length + j] = s1.data[j];
str.length = s1.length + s2.length;
return str;
}
//8.删除子串
SqString DelStr(SqString s, int i, int j)
{
int k;
SqString str;
str.length = 0;
if (i <= 0 || i > s.length || i + j - 1 > s.length)
return str;
for (k = 0; k < i - 1; k++)
str.data[k] = s.data[k];
for (k = j + i - 1; k < s.length; k++)
str.data[k - j] = s.data[k];
str.length = s.length - j;
return str;
}
//9.子串的替换
SqString InsStr(SqString s, int i, int j, SqString t)
{
int k;
SqString str;
str.length = 0;
if (i <= 0 || i > s.length || i + j - 1 > s.length)
return str;
for (k = 0; k < i - 1; k++)
str.data[k] = s.data[k];
for (k = 0; k < t.length; k++)
str.data[i + k - 1] = t.data[k];
for (k = j + i - 1; k < s.length; k++)
str.data[k - j + t.length] = s.data[k];
str.length = s.length - j + t.length;
return str;
}
//10.输出串
void DispStr(SqString s)
{
int i;
if (s.length > 0)
{
for (i = 0; i < s.length; i++)
printf("%c", s.data[i]);
printf("\n");
}
}
//11.求子串
SqString SubStr(SqString s, int i, int j)
{
int k;
SqString str;
str.length = 0;
if (i<-0 || i>s.length || j<0 || i + j - 1>s.length)
return str;
for (k = i - 1; k < i + j - 1; k++)
str.data[k - i + 1] = s.data[k];
str.length = j;
return str;
}
//以下为BF算法,KMP算法的代码实现
//BF算法
int BF(SqString s, SqString t)
{
int j = 0, i = 0;
while (i < s.length && j < t.length)
{
if (s.data[i] == t.data[j])
{
i++; j++;
}
else
{
i = i - j + 1; j = 0;
}
}
if (j >= t.length)
return(i - t.length);
else return -1;
}
//KMP算法
void GetNext(SqString t, int next[]) //求Next数组
{
int j, k;
j = 0;
k = -1;
next[0] = -1;
while (j < t.length - 1)
{
if (k == -1 || t.data[j] == t.data[k])
{
j++;
k++;
next[j] = k;
}
else
k = next[k];
}
}
int KMPIndex(SqString s, SqString t) //查找
{
int next[MaxSize], i = 0, j = 0;
GetNext(t, next);
while (i < s.length && j < t.length)
{
if (j == -1 || s.data[i] == t.data[j])
{
i++;
j++;
}
else
j = next[j];
}
if (j >= t.length)
return(i - t.length);
else
return(-1);
}
//改进后的KMP算法
void GetNextval(SqString t, int nextval[]) //求Nextval数组
{
int j = 0, k = -1;
nextval[0] = -1;
while (j < t.length - 1)
{
if (k == -1 || t.data[j] == t.data[k])
{
j++;
k++;
if (t.data[j] != t.data[k])
nextval[j] = k;
else
nextval[j] = nextval[k];
}
else
k = nextval[k];
}
}
int KMPIndex1(SqString s, SqString t) //改进后的KMP算法查找
{
int nextval[MaxSize], i = 0, j = 0;
GetNextval(t, nextval);
while (i < s.length && j < t.length)
{
if (j == -1 || s.data[i] == t.data[j])
{
i++;
j++;
}
else
j = nextval[j];
}
if (j >= t.length)
return(i - t.length);
else
return(-1);
}
int main()
{
SqString s, t;
printf("学号:\t\t\t姓名:\n");
time_t nowtime;
time(&nowtime);
tm* p = localtime(&nowtime);
printf("日期:%04d-%02d-%02d\t时间:%02d:%02d:%02d\n\n", p->tm_year + 1900,
p->tm_mon + 1, p->tm_mday, p->tm_hour, p->tm_min, p->tm_sec);
printf("(1)建立串s,t\n");
char cstr[] = "abcabcdabcdeabcdefabcdefg";
char cstr1[] = "abcdeabcdefab";
StrAssign(s, cstr);
StrAssign(t, cstr1);
printf("\n");
printf("(2)输出串s:");
DispStr(s);
printf("\n");
printf("(3)输出串t:");
DispStr(t);
printf("\n");
printf("t的next数组: ");
//由于vstudio中不支持C99标准,所以无法使用变量作为数组长度
//所以采用动态内存分配的方式来为数组分配空间
int* next;
next = (int*)malloc(t.length * sizeof(int));
if (next == NULL)
exit(-1);
GetNext(t, next);
for (int i = 0; i < t.length; i++)
printf("%-5d", next[i]);
printf("\n");
printf("t的nextval数组:");
int* nextval;
nextval = (int*)malloc(t.length * sizeof(int));
if (nextval == NULL)
exit(-1);
GetNextval(t, nextval);
for (int i = 0; i < t.length; i++)
printf("%-5d", nextval[i]);
printf("\n\n");
//DevC++中支持C99标准,所以可以用如下代码实现
//printf("t的next数组: ");
//int next[t.length];
//GetNext(t, next);
//for (int i = 0; i < t.length; i++)
//printf("%-5d", next[i]);
//printf("\n");
//printf("t的nextval数组:");
//int nextval[t.length];
//GetNextval(t, nextval);
//for (int i = 0; i < t.length; i++)
//printf("%-5d", nextval[i]);
//printf("\n");
printf("(4)采用KMP算法求出");
KMPIndex(s, t);
printf("t在s中的位置为:%d\n\n", KMPIndex(s, t));
printf("(5)采用改进的KMP算法求出");
KMPIndex1(s, t);
printf("t在s中的位置为:%d\n", KMPIndex1(s, t));
return 0;
}
运行结果如下图所示:
通过这3个实验,我们可以充分的理解在代码思维下,各种基本算法的运行模式。
好了,本文到这里就已经完结了,感谢大家的阅读!