顺序存储的静态分配
typedef struct{ //静态分配
char ch[Maxsize];
int length;
}SString;
int main()
{
SString s;
s.length = 0; //初始化
return 0;
}
顺序存储的动态分配
typedef struct{ //动态分配
char *ch;
int length;
}HString;
int main()
{
HString s;
s = (char *)malloc(sizeof(char)*Maxsize);
s.length = 0; //初始化
return 0;
}
链式存储
typedef struct SStringNode{
char ch;
struct SStringNode *next;
}SStringNode, *SString;
int main()
{
SString s;
s = (SStringNode *)malloc(sizeof(SStringNode));
s.next = NULL;
}
---------------------------------------------------------------------
typedef struct SStringNode{
char ch; //每个节点存一个字符会使存储密度低;每个字符1B,每个指针4B
struct SStringNode *next;
}SStringNode, *SString;
typedef struct SStringNode{
char ch[4]; //每个节点存多个字符会使存储密度提高;
struct SStringNode *next;
}SStringNode, *SString;
求子串
bool substring(SString *s, SString *sub, int pow, int len)
{
if(pow+len-1 > s->length) //判断是否超出边界
return false;
int i;
for(i = pow; i<pow+len-1; i++)
{
*sub->ch[i-pow+1] = s->ch[i];
}
return true;
}
两个串比较大小
/*
先看短的字符串是不是与长的字符串前面的部分是否相同,不同,直接用不同的地方相减;
相同,则两个字符串长度相减
*/
int strcompare(SString *s, SString *p)
{
int i;
for(i = 1; i<=s->length && i<=s->length; i++)
{
if(s->ch[i] != p->ch[i])
{
return s->ch[i] - p->ch[i];
}
}
return s->length - p->length;
}
定位
//定位操作,若主串中有此子串,则返回其位置,没有返回0
int index(SString *s, SString *p)
{
int i;
for(i = 1; i<=s->length - p->length +1; i++)
{
SString sub;
substring(s, &sub, i, p->length);
if(strcompare(sub, p) == 0)
return i;
}
return 0;
}