串.c

#include <stdio.h>
#include <malloc.h>

//串的动态数组存储不仅空间利用率高，而且可以随意的改数组元素，因此是最被普遍使用的。串的动态数组存储难点在于插入和删除子串时候代码的书写，同学们应该理解并且记住。重点在于结构体的建立，不仅动态数组char *str，还有长度和最大长度。

typedef struct
{
char *str;
int length;
int maxLength;
}DString;


void Initiate(DString *S,int n,char *string)
{
int i;
S->length=strlen(string);
S->str=(char *)malloc(sizeof(char)*n);
for(i=0;i<strlen(string);i++)
{
S->str[i]=string[i];
}
S->maxLength=n;
}


int Insert(DString *S,int pos,DString T)
{
int i;
if(pos<0)
{
printf("参数pos出错！");
return 0;
}
else
{
if(S->length+T.length>S->maxLength)
{
realloc(S->str,(S->length+T.length)*sizeof(char));
S->maxLength=S->length+T.length;
}
for(i=S->length-1;i>=pos;i--)
{
S->str[T.length+i]=S->[i];
}
for(i=0;i<T.length;i++)
{
S->str[pos+i]=T.str[i];
}
S->length+=T.length;
return 1;
}
}


int Delete(DString *S,int pos,int len)
{
int i;
if(S->length<=0)
{
printf("无数据可删！");
return 0;
}
else if(pos<0 || len <0 || pos+len>S->length)
{
printf("参数pos或len越界！");
return 0;
}
else
{
for(i=pos+len;i<S->length;i++)
{
S->str[i-len]=S->str[i];
}
S->length-=len;
return 1;
}
}


int Get(DString *S,int pos,int len,DString *T)
{
int i;
if(pos<0 || len<0 || pos+len>S->length)
{
printf("参数len或pos越界！");
return 0;
}
else
{
if(T->maxLength<len)
{
T->str=(char *)malloc(sizeof(char)*len);
T->maxLength=len;
}
for(i=0;i<len;i++)
{
T->str[i]=S->str[pos+i];
}
T->length=len;
return 1;
}
}


void Destroy(DString *S)
{
free(S->str);
S->length=0;
S->maxLength=0;
}