#include <iostream>
#include <malloc.h>
#include <stdio.h>
#include <cstring>
using namespace std;
typedef struct snode
{
char data;
struct snode *next;
}LinkStrNode;
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;
}
void DestroyStr(LinkStrNode *&s)//销毁
{
LinkStrNode *pre=s,*p=s->next;
while(p!=NULL)
{
free(pre);
pre=p;
p=pre->next;
}
free(pre);
}
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;
}
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;
}
int StrLength(LinkStrNode *s)//求串长
{
int i=0;
LinkStrNode *p=s->next;
while(p!=NULL)
{
i++;
p=p->next;
}
return i;
}
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;
}
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;
}
void DispStr(LinkStrNode *s)//输出字符串
{
LinkStrNode *p=s->next;
while(p!=NULL)
{
cout<<p->data;
p=p->next;
}
cout<<"\n";
}
LinkStrNode *RepStr(LinkStrNode *s,int i,int j,LinkStrNode *t)//将s中从第i个开始j个子字符串用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=0;k<i-1;k++)
{
q=(LinkStrNode *)malloc(sizeof(LinkStrNode));
q->data=p->data;q->next=NULL;
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;q->next=NULL;
r->next=q;r=q;
p1=p1->next;
}
while(p!=NULL)
{
q=(LinkStrNode *)malloc(sizeof(LinkStrNode));
q->data=p->data;q->next=NULL;
r->next=q;r=q;
p=p->next;
}
r->next=NULL;
return str;
}