devbox
Cpp五条
这个屌丝很懒，什么也没留下！
关注作者
热门标签
热门文章
当前位置:   article > 正文

【详解】串（顺序串，链串）的基本运算（插入，链接，替换等全有）有给源码----看这一篇就够了_顺序串插入

作者：Cpp五条 | 2024-05-02 11:27:38

赞

踩

顺序串插入

介绍：

什么是串，字符串简称串,剩下大家都知道，我就不多说，直接上重点，基本运算。

void StrAssign(SqString* s, char* cstr) 字符串常量赋给串s

void Display(SqString* s) 输出串s

void Destroy(SqString* s) 摧毁串

void StrCopy(SqString* s, SqString* t) 串复制

bool StrEqual(SqString* s, SqString* t) 判串相等

int StrLength(SqString* s) 求串长

SqString* Concat(SqString* s, SqString* t) 串连接

SqString* SubStr(SqString* s, int i, int j) 求子串

SqString* InsStr(SqString*str1, int i, SqString*str2) 插入串

SqString* DelStr(SqString* str, int i, int j) 串删去

SqString* RepStr(SqString* s, int i, int j, SqString* t) 子串替换

顺序串的基本运算

结构体

SqString

  1. typedef struct str
  2. {
  3. 	char data[1000];
  4. 	int length;
  5. }SqString;

void StrAssign(SqString* s, char* cstr)

字符串常量赋给串s

  1. void StrAssign(SqString* s, char* cstr)
  2. {
  3. 	strcpy(s->data, cstr);
  4. 	return;
  5. }

void Display(SqString* s)

 输出串s

  1. void Display(SqString* s)
  2. {
  3. 	printf("%s", s->data);//*s.data
  4. 	return;
  5. }

void Destroy(SqString* s)

摧毁串

  1. void Destroy(SqString* s)
  2. {
  3. 	free(s);
  4. }

void StrCopy(SqString* s, SqString* t) 

串复制

  1. void StrCopy(SqString* s, SqString* t)
  2. {
  3. 	strcpy(s->data, t->data);
  4. 	return;
  5. }

bool StrEqual(SqString* s, SqString* t)

 判串相等

  1. bool StrEqual(SqString* s, SqString* t)
  2. {
  3. 	int x = strcmp(s->data, t->data);
  4. 	if (x == 0) return true;
  5. 	else return false;
  6. }

int StrLength(SqString* s) 

求串长

  1. int StrLength(SqString* s)
  2. {
  3. 	int count = strlen(s->data);
  4. 	return count;
  5. }

SqString* Concat(SqString* s, SqString* t) 

串连接

  1. SqString* Concat(SqString* s, SqString* t)
  2. {
  3. 	SqString* c = (SqString*)malloc(sizeof(SqString));
  4. 	strcpy(c->data, s->data);
  5. 	strcat(c->data, t->data);
  6. 	return c;
  7. }

SqString* SubStr(SqString* s, int i, int j)

 求子串

  1. SqString* SubStr(SqString* s, int i, int j)
  2. {
  3. 	int len = StrLength(s);
  4. 	SqString* last = (SqString*)malloc(sizeof(SqString));
  5. 	if (i<1 || i>len || j<0 || i + j - 1>len) return last;
  6. 	int k = 0;
  7. 	for ( k = 0; k < j; k++)
  8. 	{
  9. 		last->data[k] = s->data[i + k-1];
  10. 	}
  11. 	last->data[k] = '\0';
  12. 	return last;
  13. }

SqString* InsStr(SqString*str1, int i, SqString*str2)

 插入串

  1. SqString* InsStr(SqString*str1, int i, SqString*str2)
  2. {
  3. 	int len1 = StrLength(str1);
  4. 	int len2 = StrLength(str2);
  5. 	SqString* last = (SqString*)malloc(sizeof(SqString));
  6. 	if (i <= 0 || i > len1 + 1) return last;
  7. 	int k = 0;
  8. 	int j = 0;
  9. 	int h = 0;
  10. 	for (k = 0; k < i - 1; k++)
  11. 	{
  12. 		last->data[k] = str1->data[k];
  13. 	}
  14. 	for ( j = 0; j < len2; j++)
  15. 	{
  16. 		last->data[k + j] = str2->data[j];
  17. 	}
  18. 	for ( h = k; h < len1; h++)//小心
  19. 	{
  20. 		last->data[h + k + j-1] = str1->data[h];
  21. 	}
  22. 	last->data[h + k + j-1] = '\0';//字符串一定记得要给一个结束标志
  23. 	return last;
  24. }

SqString* DelStr(SqString* str, int i, int j)

 串删去

  1. SqString* DelStr(SqString* str, int i, int j)
  2. {
  3. 	int len = StrLength(str);
  4. 	SqString* last = (SqString*)malloc(sizeof(SqString));
  5. 	if (i <= 0 || i > len || i + j - 1 > len) return last;//防止越界，力扣不这样做会ovreflow
  6. 	int x, y, z;
  7. 	for (x = 0; x < i - 1; x++)
  8. 	{
  9. 		last->data[x] = str->data[x];
  10. 	}//x=i-1
  11. 	for (y = i + j - 1; y < len; y++)
  12. 	{
  13. 		last->data[x++] = str->data[y];
  14. 	}
  15. 	last->data[x] = '\0';
  16. 	return last;
  17. }

SqString* RepStr(SqString* s, int i, int j, SqString* t)

 子串替换

  1. SqString* RepStr(SqString* s, int i, int j, SqString* t)
  2. {
  3. 	int len = StrLength(s);
  4. 	int len2 = StrLength(t);
  5. 	SqString* last = (SqString*)malloc(sizeof(SqString));
  6. 	if (i <= 0 || i > len || j<0 || i + j - 1>len) return last;
  7. 	int x, y, z;
  8. 	for (x = 0; x < i - 1; x++)
  9. 	{
  10. 		last->data[x] = s->data[x];
  11. 	}
  12. 	for (y = 0; y < len2; y++)
  13. 	{
  14. 		last->data[x + y] = t->data[y];
  15. 	}
  16. 	int h = 0;
  17. 	for (z = i + j - 1; z < len; z++)
  18. 	{
  19. 		last->data[x + y +h] = s->data[z];
  20. 		h++;
  21. 	}
  22. 	last->data[x + y + h] = '\0';
  23. 	return last;
  24. }

总代码c语言

  1. #define  _CRT_SECURE_NO_WARNINGS 1
  2. //串的基本运算
  3. #include <stdio.h>
  4. #include <string.h>
  5. #include <stdlib.h>
  6. #include <stdbool.h>
  7. typedef struct str
  8. {
  9. 	char data[1000];
  10. 	int length;
  11. }SqString;
  12. void StrAssign(SqString* s, char* cstr)
  13. {
  14. 	strcpy(s->data, cstr);
  15. 	return;
  16. }
  17. void Display(SqString* s)
  18. {
  19. 	printf("%s", s->data);//*s.data
  20. 	return;
  21. }
  22. void Destroy(SqString* s)
  23. {
  24. 	free(s);
  25. }
  26. void StrCopy(SqString* s, SqString* t)
  27. {
  28. 	strcpy(s->data, t->data);
  29. 	return;
  30. }
  31. bool StrEqual(SqString* s, SqString* t)
  32. {
  33. 	int x = strcmp(s->data, t->data);
  34. 	if (x == 0) return true;
  35. 	else return false;
  36. }
  37. int StrLength(SqString* s)
  38. {
  39. 	int count = strlen(s->data);
  40. 	return count;
  41. }
  42. SqString* Concat(SqString* s, SqString* t)
  43. {
  44. 	SqString* c = (SqString*)malloc(sizeof(SqString));
  45. 	strcpy(c->data, s->data);
  46. 	strcat(c->data, t->data);
  47. 	return c;
  48. }
  49. SqString* SubStr(SqString* s, int i, int j)
  50. {
  51. 	int len = StrLength(s);
  52. 	SqString* last = (SqString*)malloc(sizeof(SqString));
  53. 	if (i<1 || i>len || j<0 || i + j - 1>len) return last;
  54. 	int k = 0;
  55. 	for ( k = 0; k < j; k++)
  56. 	{
  57. 		last->data[k] = s->data[i + k-1];
  58. 	}
  59. 	last->data[k] = '\0';
  60. 	return last;
  61. }
  62. SqString* InsStr(SqString*str1, int i, SqString*str2)
  63. {
  64. 	int len1 = StrLength(str1);
  65. 	int len2 = StrLength(str2);
  66. 	SqString* last = (SqString*)malloc(sizeof(SqString));
  67. 	if (i <= 0 || i > len1 + 1) return last;
  68. 	int k = 0;
  69. 	int j = 0;
  70. 	int h = 0;
  71. 	for (k = 0; k < i - 1; k++)
  72. 	{
  73. 		last->data[k] = str1->data[k];
  74. 	}
  75. 	for ( j = 0; j < len2; j++)
  76. 	{
  77. 		last->data[k + j] = str2->data[j];
  78. 	}
  79. 	for ( h = k; h < len1; h++)//小心
  80. 	{
  81. 		last->data[h + k + j-1] = str1->data[h];
  82. 	}
  83. 	last->data[h + k + j-1] = '\0';//字符串一定记得要给一个结束标志
  84. 	return last;
  85. }
  86. SqString* DelStr(SqString* str, int i, int j)
  87. {
  88. 	int len = StrLength(str);
  89. 	SqString* last = (SqString*)malloc(sizeof(SqString));
  90. 	if (i <= 0 || i > len || i + j - 1 > len) return last;//防止越界，力扣不这样做会ovreflow
  91. 	int x, y, z;
  92. 	for (x = 0; x < i - 1; x++)
  93. 	{
  94. 		last->data[x] = str->data[x];
  95. 	}//x=i-1
  96. 	for (y = i + j - 1; y < len; y++)
  97. 	{
  98. 		last->data[x++] = str->data[y];
  99. 	}
  100. 	last->data[x] = '\0';
  101. 	return last;
  102. }
  103. SqString* RepStr(SqString* s, int i, int j, SqString* t)
  104. {
  105. 	int len = StrLength(s);
  106. 	int len2 = StrLength(t);
  107. 	SqString* last = (SqString*)malloc(sizeof(SqString));
  108. 	if (i <= 0 || i > len || j<0 || i + j - 1>len) return last;
  109. 	int x, y, z;
  110. 	for (x = 0; x < i - 1; x++)
  111. 	{
  112. 		last->data[x] = s->data[x];
  113. 	}
  114. 	for (y = 0; y < len2; y++)
  115. 	{
  116. 		last->data[x + y] = t->data[y];
  117. 	}
  118. 	int h = 0;
  119. 	for (z = i + j - 1; z < len; z++)
  120. 	{
  121. 		last->data[x + y +h] = s->data[z];
  122. 		h++;
  123. 	}
  124. 	last->data[x + y + h] = '\0';
  125. 	return last;
  126. }
  127. int main()
  128. {
  129. 	SqString* str1 = (SqString*)malloc(sizeof(SqString));
  130. 	SqString* str2 = (SqString*)malloc(sizeof(SqString));
  131. 	char cstr[20] = "abcdef";
  132. 	char s[20] = "mm";
  133. 	//char s[20] = "de";
  134. 	StrAssign(str1, cstr);
  135. 	StrAssign(str2, s);
  136. 	SqString* str4 = RepStr(str1, 2, 3, str2);
  137. 	printf("%s", str4->data);
  138. 	
  139. 	return 0;
  140. }

总代码c++

  1. //顺序串基本运算的算法
  2. #include <stdio.h>
  3. #define MaxSize 100
  4. typedef struct
  5. {	
  6. 	char data[MaxSize];
  7. 	int length;			//串长
  8. } SqString;
  9. void StrAssign(SqString &s,char cstr[])	//字符串常量赋给串s
  10. {
  11. 	int i;
  12. 	for (i=0;cstr[i]!='\0';i++)
  13. 		s.data[i]=cstr[i];
  14. 	s.length=i;
  15. }
  16. void DestroyStr(SqString &s)
  17. {  }
  18.  
  19. void StrCopy(SqString &s,SqString t)	//串复制
  20. {
  21. 	int i;
  22. 	for (i=0;i<t.length;i++)
  23. 		s.data[i]=t.data[i];
  24. 	s.length=t.length;
  25. }
  26. bool StrEqual(SqString s,SqString t)	//判串相等
  27. {
  28. 	bool same=true;
  29. 	int i;
  30. 	if (s.length!=t.length)				//长度不相等时返回0
  31. 		same=false;
  32. 	else 
  33. 		for (i=0;i<s.length;i++)
  34. 			if (s.data[i]!=t.data[i])	//有一个对应字符不相同时返回0
  35. 			{	same=false;
  36. 				break;
  37. 			}
  38. 	return same;
  39. }
  40. int StrLength(SqString s)	//求串长
  41. {
  42. 	return s.length;
  43. }
  44. SqString Concat(SqString s,SqString t)	//串连接
  45. {
  46. 	SqString str;
  47. 	int i;
  48. 	str.length=s.length+t.length;
  49. 	for (i=0;i<s.length;i++)	//将s.data[0..s.length-1]复制到str
  50. 		str.data[i]=s.data[i];
  51. 	for (i=0;i<t.length;i++)	//将t.data[0..t.length-1]复制到str
  52. 		str.data[s.length+i]=t.data[i];
  53. 	return str;
  54. }
  55. SqString SubStr(SqString s,int i,int j)	//求子串
  56. {
  57. 	SqString str;
  58. 	int k;
  59. 	str.length=0;
  60. 	if (i<=0 || i>s.length || j<0 || i+j-1>s.length)
  61. 		return str;					//参数不正确时返回空串
  62. 	for (k=i-1;k<i+j-1;k++)  		//将s.data[i..i+j]复制到str
  63. 		str.data[k-i+1]=s.data[k];
  64. 	str.length=j;
  65. 	return str;
  66. } 
  67. SqString InsStr(SqString s1,int i,SqString s2)	//插入串
  68. {
  69. 	int j;
  70. 	SqString str;
  71. 	str.length=0;
  72. 	if (i<=0 || i>s1.length+1)  //参数不正确时返回空串
  73. 		return str;
  74. 	for (j=0;j<i-1;j++)      		//将s1.data[0..i-2]复制到str
  75. 		str.data[j]=s1.data[j];
  76. 	for (j=0;j<s2.length;j++)		//将s2.data[0..s2.length-1]复制到str
  77. 		str.data[i+j-1]=s2.data[j];
  78. 	for (j=i-1;j<s1.length;j++)		//将s1.data[i-1..s1.length-1]复制到str
  79. 		str.data[s2.length+j]=s1.data[j];
  80. 	str.length=s1.length+s2.length;
  81. 	return str;
  82. }
  83. SqString DelStr(SqString s,int i,int j)		//串删去
  84. {
  85. 	int k;
  86. 	SqString str;
  87. 	str.length=0;
  88. 	if (i<=0 || i>s.length || i+j>s.length+1) //参数不正确时返回空串
  89. 		return str;
  90. 	for (k=0;k<i-1;k++)       		//将s.data[0..i-2]复制到str
  91. 		str.data[k]=s.data[k];
  92. 	for (k=i+j-1;k<s.length;k++)	//将s.data[i+j-1..s.length-1]复制到str
  93. 		str.data[k-j]=s.data[k];
  94. 	str.length=s.length-j;
  95. 	return str;
  96. }
  97. SqString RepStr(SqString s,int i,int j,SqString t)	//子串替换
  98. {
  99. 	int k;
  100. 	SqString str;
  101. 	str.length=0;
  102. 	if (i<=0 || i>s.length || i+j-1>s.length) //参数不正确时返回空串
  103. 		return str;
  104. 	for (k=0;k<i-1;k++)				//将s.data[0..i-2]复制到str
  105. 		str.data[k]=s.data[k];
  106. 	for (k=0;k<t.length;k++)   		//将t.data[0..t.length-1]复制到str
  107. 		str.data[i+k-1]=t.data[k];
  108. 	for (k=i+j-1;k<s.length;k++)	//将s.data[i+j-1..s.length-1]复制到str
  109. 		str.data[t.length+k-j]=s.data[k];
  110. 	str.length=s.length-j+t.length;
  111. 	return str;
  112. }
  113. void DispStr(SqString s)	//输出串s
  114. {
  115. 	int i;
  116. 	if (s.length>0)
  117. 	{	for (i=0;i<s.length;i++)
  118. 			printf("%c",s.data[i]);
  119. 		printf("\n");
  120. 	}
  121. }

链串的基本运算

为了防止文章过长链串的基本运算我直接全部给出有需要的自取

c语言总代码

  1. #define  _CRT_SECURE_NO_WARNINGS 1
  2. //链串
  3. #include <stdlib.h>
  4. #include <stdio.h>
  5. #include <stdbool.h>
  6. #include <string.h>
  7. typedef struct snode
  8. {
  9. 	char data;
  10. 	struct snode* next;
  11. }LinkStrNode;
  12. void StrAssign(LinkStrNode* s, char*cstr)
  13. {
  14. 	int len = strlen(cstr);
  15. 	LinkStrNode* pre = s;
  16. 	for (int i = 0; i < len; i++)
  17. 	{
  18. 		LinkStrNode* p = (LinkStrNode*)malloc(sizeof(LinkStrNode));
  19. 		p->data = cstr[i];
  20. 		pre->next = p;
  21. 		pre = p;
  22.  
  23. 	}
  24. 	pre->next = NULL;
  25. }
  26. void Display(LinkStrNode* s)
  27. {
  28. 	LinkStrNode* p = s->next;
  29. 	while (p != NULL)
  30. 	{
  31. 		printf("%c", p->data);
  32. 		p = p->next;
  33. 	}
  34. 	return;
  35. }
  36. void DestroyStr(LinkStrNode* s)
  37. {
  38. 	LinkStrNode* p = s->next;
  39. 	LinkStrNode* pre = s;
  40. 	while (p != NULL)
  41. 	{
  42. 		free(pre);
  43. 		pre = p;
  44. 		p = p->next;
  45. 	}
  46. 	free(pre);
  47. }
  48. void StrCopy(LinkStrNode* s, LinkStrNode* t)
  49. {
  50. 	LinkStrNode* ps = s;
  51. 	LinkStrNode* pt = t;
  52. 	while (pt != NULL)
  53. 	{
  54. 		ps->data = pt->data;
  55. 		ps = ps->next; pt = pt->next;
  56. 	}
  57. 	return;
  58. }
  59. bool StrEqual(LinkStrNode* s, LinkStrNode* t)
  60. {
  61. 	LinkStrNode* ps = s;
  62. 	LinkStrNode* pt = t;
  63. 	while (ps != NULL && pt != NULL)
  64. 	{
  65. 		if (ps->data != pt->data) return false;
  66. 		ps = ps->next; pt = pt->next;
  67. 	}
  68. 	if (ps != NULL || pt != NULL) return false;
  69. 	return true;
  70. }
  71. int StrLength(LinkStrNode* s)
  72. {
  73. 	int count = 0;
  74. 	LinkStrNode* p = s->next;
  75. 	while (p != NULL)
  76. 	{
  77. 		count++;
  78. 		p = p->next;
  79. 	}
  80. 	return count;
  81. }
  82. LinkStrNode* Concat(LinkStrNode* s, LinkStrNode* t)
  83. {
  84. 	LinkStrNode* last = (LinkStrNode*)malloc(sizeof(LinkStrNode));
  85. 	LinkStrNode* p = last;
  86. 	LinkStrNode* ps = s->next;
  87. 	LinkStrNode* pt = t->next;
  88.  
  89. 	while (ps != NULL)
  90. 	{
  91. 		LinkStrNode* q = (LinkStrNode*)malloc(sizeof(LinkStrNode));
  92. 		q->data = ps->data;
  93. 		p->next = q;
  94. 		ps = ps->next;
  95. 		p = q;
  96. 	}
  97. 	while (pt != NULL)
  98. 	{
  99. 		LinkStrNode* q = (LinkStrNode*)malloc(sizeof(LinkStrNode));
  100. 		q->data = pt->data;
  101. 		p->next = q;
  102. 		pt = pt->next;
  103. 		p = q;
  104. 	}
  105. 	p->next = NULL;
  106. 	return last;
  107. }
  108. LinkStrNode* SubStr(LinkStrNode* s, int i, int j)
  109. {
  110. 	int len = StrLength(s);
  111. 	LinkStrNode* last = (LinkStrNode*)malloc(sizeof(LinkStrNode));
  112. 	if (i <= 0 || i > len || j<0 || i + j - 1>len) return last;
  113. 	LinkStrNode* p = s;
  114. 	LinkStrNode* pres = last;
  115. 	for (int z = 0; z < i; z++) p = p->next;
  116. 	for (int x = 0; x < j; x++)
  117. 	{
  118. 		LinkStrNode* q = (LinkStrNode*)malloc(sizeof(LinkStrNode));
  119. 		q->data = p->data;
  120. 		pres->next = q;
  121. 		pres = q;
  122. 		p = p->next;
  123. 	}
  124. 	pres->next = NULL;
  125. 	return last;
  126. }
  127. LinkStrNode* InsStr(LinkStrNode* s, int i, LinkStrNode* t)
  128. {
  129. 	int len = StrLength(s);
  130. 	LinkStrNode* last = (LinkStrNode*)malloc(sizeof(LinkStrNode));
  131. 	if (i <= 0 || i > len + 1) return last;
  132. 	LinkStrNode* ps = s->next;
  133. 	LinkStrNode* pl = last;
  134. 	int j, k, h;
  135. 	for (j = 0;ps!=NULL&& j < i - 1; j++)
  136. 	{
  137. 		LinkStrNode* q = (LinkStrNode*)malloc(sizeof(LinkStrNode));
  138. 		q->data = ps->data;
  139. 		pl->next = q;
  140. 		pl = q;
  141. 		ps = ps->next;
  142. 	}
  143. 	int len2 = StrLength(t);
  144. 	LinkStrNode* pt = t->next;
  145. 	for ( k = 0;pt!=NULL&& k < len2; k++)
  146. 	{
  147. 		LinkStrNode* q = (LinkStrNode*)malloc(sizeof(LinkStrNode));
  148. 		q->data = pt->data;
  149. 		pl->next = q;
  150. 		pl = q;
  151. 		pt = pt->next;
  152. 	}
  153. 	for (h = j; ps!=NULL&&h < len; h++)
  154. 	{
  155. 		LinkStrNode* q = (LinkStrNode*)malloc(sizeof(LinkStrNode));
  156. 		q->data = ps->data;
  157. 		pl->next = q;
  158. 		pl = q;
  159. 		ps = ps->next;
  160. 	}
  161. 	pl->next = NULL;
  162. 	return last;
  163. }
  164. LinkStrNode* DelStr(LinkStrNode* s, int i, int j)
  165. {
  166. 	int len = StrLength(s);
  167. 	
  168. 	LinkStrNode* last = (LinkStrNode*)malloc(sizeof(LinkStrNode));
  169. 	if (len < 1) return last;
  170. 	if (i <= 0 || i > len || j<0 || i + j - 1>len) return last;
  171. 	LinkStrNode* ps = s->next;
  172. 	LinkStrNode* pa = last;
  173. 	int x, y, h;
  174. 	for ( x = 0; x < i-1; x++)
  175. 	{
  176. 		LinkStrNode* q = (LinkStrNode*)malloc(sizeof(LinkStrNode));
  177. 		q->data = ps->data;
  178. 		pa->next = q;
  179. 		pa = q;
  180. 		ps = ps->next;	
  181. 	}	
  182. 	for ( y = 0; y < j; y++)
  183. 	{
  184. 		ps = ps->next;
  185. 	}
  186. 	for (h = x + y; h < len; h++)
  187. 	{
  188. 		LinkStrNode* q = (LinkStrNode*)malloc(sizeof(LinkStrNode));
  189. 		q->data = ps->data;
  190. 		pa->next = q;
  191. 		pa = q;
  192. 		ps = ps->next;
  193. 	}
  194. 	pa->next = NULL;
  195. 	return last;
  196. }
  197. LinkStrNode* RepStr(LinkStrNode* s, int i, int j, LinkStrNode* t)
  198. {
  199. 	int len = StrLength(s);
  200. 	LinkStrNode* last = (LinkStrNode*)malloc(sizeof(LinkStrNode));
  201. 	if (len < 1) return last;
  202. 	if (i <= 0 || i > len || j<0 || i + j - 1>len) return last;
  203. 	int x, y, z;
  204. 	LinkStrNode* ps = s->next;
  205. 	LinkStrNode* pt = last;
  206. 	for (x = 0; x < i - 1; x++)
  207. 	{
  208. 		LinkStrNode* q = (LinkStrNode*)malloc(sizeof(LinkStrNode));
  209. 		q->data = ps->data;
  210. 		pt->next = q;
  211. 		pt = q;
  212. 		ps = ps->next;
  213. 	}
  214. 	int len2 = StrLength(t);
  215. 	LinkStrNode* pt2 = t->next;
  216. 	for (y = 0; pt2!=NULL&&y < len2; y++)
  217. 	{
  218. 		LinkStrNode* q = (LinkStrNode*)malloc(sizeof(LinkStrNode));
  219. 		q->data = pt2->data;
  220. 		pt->next = q;
  221. 		pt = q;
  222. 		pt2 = pt2->next;
  223. 	}
  224. 	int k;
  225. 	for ( k = 0; k < j; k++) ps = ps->next;
  226. 	for (z = x + k; z < len; z++)
  227. 	{
  228. 		LinkStrNode* q = (LinkStrNode*)malloc(sizeof(LinkStrNode));
  229. 		q->data = ps->data;
  230. 		pt->next = q;
  231. 		pt = q;
  232. 		ps = ps->next;
  233.  
  234. 	}
  235. 	pt->next = NULL;
  236. 	return last;
  237. }
  238. int main()
  239. {
  240. 	LinkStrNode* s = (LinkStrNode*)malloc(sizeof(LinkStrNode));
  241. 	LinkStrNode* t = (LinkStrNode*)malloc(sizeof(LinkStrNode));
  242. 	char str[] = "abcd";
  243. 	char str2[] = "mmm";
  244. 	StrAssign(t, str2);
  245.  	StrAssign(s, str);
  246. 	//LinkStrNode* y = SubStr(s, 2, 3);
  247. 	//LinkStrNode*y = Concat(s, t);
  248. 	//int h = StrLength(s);
  249. 	//int k = StrEqual(t, s);
  250. 	//printf("%d", h);
  251. 	LinkStrNode* y = RepStr(s, 2,2,t);
  252. 	Display(y);
  253. 	return 0;
  254. }

c++总代码

  1. //链串基本运算的算法
  2. #include <stdio.h>
  3. #include <malloc.h>
  4. typedef struct snode 
  5. {	
  6. 	char data;
  7. 	struct snode *next;
  8. } LinkStrNode;
  9. void StrAssign(LinkStrNode *&s,char cstr[])	//字符串常量cstr赋给串s
  10. {
  11. 	int i;
  12. 	LinkStrNode *r,*p;
  13. 	s=(LinkStrNode *)malloc(sizeof(LinkStrNode));
  14. 	r=s;						//r始终指向尾结点
  15. 	for (i=0;cstr[i]!='\0';i++) 
  16. 	{	p=(LinkStrNode *)malloc(sizeof(LinkStrNode));
  17. 		p->data=cstr[i];
  18. 		r->next=p;r=p;
  19. 	}
  20. 	r->next=NULL;
  21. }
  22. void DestroyStr(LinkStrNode *&s)
  23. {	LinkStrNode *pre=s,*p=s->next;	//pre指向结点p的前驱结点
  24. 	while (p!=NULL)					//扫描链串s
  25. 	{	free(pre);					//释放pre结点
  26. 		pre=p;						//pre、p同步后移一个结点
  27. 		p=pre->next;
  28. 	}
  29. 	free(pre);						//循环结束时,p为NULL,pre指向尾结点,释放它
  30. }
  31. void StrCopy(LinkStrNode *&s,LinkStrNode *t)	//串t复制给串s
  32. {
  33. 	LinkStrNode *p=t->next,*q,*r;
  34. 	s=(LinkStrNode *)malloc(sizeof(LinkStrNode));
  35. 	r=s;						//r始终指向尾结点
  36. 	while (p!=NULL)				//将t的所有结点复制到s
  37. 	{	q=(LinkStrNode *)malloc(sizeof(LinkStrNode));
  38. 		q->data=p->data;
  39. 		r->next=q;r=q;
  40. 		p=p->next;
  41. 	}
  42. 	r->next=NULL;
  43. }
  44. bool StrEqual(LinkStrNode *s,LinkStrNode *t)	//判串相等
  45. {
  46. 	LinkStrNode *p=s->next,*q=t->next;
  47. 	while (p!=NULL && q!=NULL && p->data==q->data) 
  48. 	{	p=p->next;
  49. 		q=q->next;
  50. 	}
  51. 	if (p==NULL && q==NULL)
  52. 		return true;
  53. 	else
  54. 		return false;
  55. }
  56. int StrLength(LinkStrNode *s)	//求串长
  57. {
  58. 	int i=0;
  59. 	LinkStrNode *p=s->next;
  60. 	while (p!=NULL) 
  61. 	{	i++;
  62. 		p=p->next;
  63. 	}
  64. 	return i;
  65. }
  66. LinkStrNode *Concat(LinkStrNode *s,LinkStrNode *t)	//串连接
  67. {
  68. 	LinkStrNode *str,*p=s->next,*q,*r;
  69. 	str=(LinkStrNode *)malloc(sizeof(LinkStrNode));
  70. 	r=str;
  71. 	while (p!=NULL)				//将s的所有结点复制到str
  72. 	{	q=(LinkStrNode *)malloc(sizeof(LinkStrNode));
  73. 		q->data=p->data;
  74. 		r->next=q;r=q;
  75. 		p=p->next;
  76. 	}
  77. 	p=t->next;
  78. 	while (p!=NULL)				//将t的所有结点复制到str
  79. 	{	q=(LinkStrNode *)malloc(sizeof(LinkStrNode));
  80. 		q->data=p->data;
  81. 		r->next=q;r=q;
  82. 		p=p->next;
  83. 	}
  84. 	r->next=NULL;
  85. 	return str;
  86. }
  87. LinkStrNode *SubStr(LinkStrNode *s,int i,int j)	//求子串
  88. {
  89. 	int k;
  90. 	LinkStrNode *str,*p=s->next,*q,*r;
  91. 	str=(LinkStrNode *)malloc(sizeof(LinkStrNode));
  92. 	str->next=NULL;
  93. 	r=str;						//r指向新建链表的尾结点
  94. 	if (i<=0 || i>StrLength(s) || j<0 || i+j-1>StrLength(s))
  95. 		return str;				//参数不正确时返回空串
  96. 	for (k=0;k<i-1;k++)
  97. 		p=p->next;
  98. 	for (k=1;k<=j;k++) 			//将s的第i个结点开始的j个结点复制到str
  99. 	{	q=(LinkStrNode *)malloc(sizeof(LinkStrNode));
  100. 		q->data=p->data;
  101. 		r->next=q;r=q;
  102. 		p=p->next;
  103. 	}
  104. 	r->next=NULL;
  105. 	return str;
  106. }
  107. LinkStrNode *InsStr(LinkStrNode *s,int i,LinkStrNode *t)		//串插入
  108. {
  109. 	int k;
  110. 	LinkStrNode *str,*p=s->next,*p1=t->next,*q,*r;
  111. 	str=(LinkStrNode *)malloc(sizeof(LinkStrNode));
  112. 	str->next=NULL;
  113. 	r=str;								//r指向新建链表的尾结点
  114. 	if (i<=0 || i>StrLength(s)+1)		//参数不正确时返回空串
  115. 		return str;
  116. 	for (k=1;k<i;k++)					//将s的前i个结点复制到str
  117. 	{	q=(LinkStrNode *)malloc(sizeof(LinkStrNode));
  118. 		q->data=p->data;
  119. 		r->next=q;r=q;
  120. 		p=p->next;
  121. 	}
  122. 	while (p1!=NULL)					//将t的所有结点复制到str
  123. 	{	q=(LinkStrNode *)malloc(sizeof(LinkStrNode));
  124. 		q->data=p1->data;
  125. 		r->next=q;r=q;
  126. 		p1=p1->next;
  127. 	}
  128. 	while (p!=NULL)						//将结点p及其后的结点复制到str
  129. 	{	q=(LinkStrNode *)malloc(sizeof(LinkStrNode));
  130. 		q->data=p->data;
  131. 		r->next=q;r=q;
  132. 		p=p->next;
  133. 	}
  134. 	r->next=NULL;
  135. 	return str;
  136. }
  137. LinkStrNode *DelStr(LinkStrNode *s,int i,int j)	//串删去
  138. {
  139. 	int k;
  140. 	LinkStrNode *str,*p=s->next,*q,*r;
  141. 	str=(LinkStrNode *)malloc(sizeof(LinkStrNode));
  142. 	str->next=NULL;
  143. 	r=str;						//r指向新建链表的尾结点
  144. 	if (i<=0 || i>StrLength(s) || j<0 || i+j-1>StrLength(s))
  145. 		return str;				//参数不正确时返回空串
  146. 	for (k=0;k<i-1;k++)			//将s的前i-1个结点复制到str
  147. 	{	q=(LinkStrNode *)malloc(sizeof(LinkStrNode));
  148. 		q->data=p->data;
  149. 		r->next=q;r=q;
  150. 		p=p->next;
  151. 	}
  152. 	for (k=0;k<j;k++)				//让p沿next跳j个结点
  153. 		p=p->next;
  154. 	while (p!=NULL)					//将结点p及其后的结点复制到str
  155. 	{	q=(LinkStrNode *)malloc(sizeof(LinkStrNode));
  156. 		q->data=p->data;
  157. 		r->next=q;r=q;
  158. 		p=p->next;
  159. 	}
  160. 	r->next=NULL;
  161. 	return str;
  162. }
  163. LinkStrNode *RepStr(LinkStrNode *s,int i,int j,LinkStrNode *t)	//串替换
  164. {
  165. 	int k;
  166. 	LinkStrNode *str,*p=s->next,*p1=t->next,*q,*r;
  167. 	str=(LinkStrNode *)malloc(sizeof(LinkStrNode));
  168. 	str->next=NULL;
  169. 	r=str;							//r指向新建链表的尾结点
  170. 	if (i<=0 || i>StrLength(s) || j<0 || i+j-1>StrLength(s))
  171. 		return str;		 			//参数不正确时返回空串
  172. 	for (k=0;k<i-1;k++)  			//将s的前i-1个结点复制到str
  173. 	{	q=(LinkStrNode *)malloc(sizeof(LinkStrNode));
  174. 		q->data=p->data;q->next=NULL;
  175. 		r->next=q;r=q;
  176. 		p=p->next;
  177. 	}
  178. 	for (k=0;k<j;k++)				//让p沿next跳j个结点
  179. 		p=p->next;
  180. 	while (p1!=NULL)				//将t的所有结点复制到str
  181. 	{	q=(LinkStrNode *)malloc(sizeof(LinkStrNode));
  182. 		q->data=p1->data;q->next=NULL;
  183. 		r->next=q;r=q;
  184. 		p1=p1->next;
  185. 	}
  186. 	while (p!=NULL)					//将结点p及其后的结点复制到str
  187. 	{	q=(LinkStrNode *)malloc(sizeof(LinkStrNode));
  188. 		q->data=p->data;q->next=NULL;
  189. 		r->next=q;r=q;
  190. 		p=p->next;
  191. 	}
  192. 	r->next=NULL;
  193. 	return str;
  194. }
  195. void DispStr(LinkStrNode *s)	//输出串
  196. {
  197. 	LinkStrNode *p=s->next;
  198. 	while (p!=NULL)
  199. 	{	printf("%c",p->data);
  200. 		p=p->next;
  201. 	}
  202. 	printf("\n");
  203. }

小结：

对文章有任何问题的还请指出，接受大家的批评，让我改进，如果大家有所收获的话还请不要吝啬你们的点赞和收藏，这可以激励我写出更加优秀的文章，本文代码均经过调试运行，如果对你有帮助的话还请给我点个赞。

声明：本文内容由网友自发贡献，不代表【wpsshop博客】立场，版权归原作者所有，本站不承担相应法律责任。如您发现有侵权的内容，请联系我们。转载请注明出处：https://www.wpsshop.cn/w/Cpp五条/article/detail/523813
推荐阅读
相关标签

Copyright © 2003-2013 www.wpsshop.cn 版权所有，并保留所有权利。

  

闽ICP备14008679号