实验三 串的堆分配存储结构

---

实验

[实验目的]
理解和掌握串的类型定义方法
掌握串的基本操作
[实验内容]
编程实现在串S中下标为pos的字符前插入串t.函数原型为int StrInsert(PSeqString s,int pos,PSeqString t)

---

HeapString.h

//HeapString.h

typedef struct
{
	char *ch;
	int len;
}HeapString;

void StrInitialize(HeapString *s);		//初始化

void StrAssign(HeapString *s,char t[]);		//生成字符串

int StrInsert(HeapString *s,int pos,HeapString t);	//将t插入到s中下标为pos的位置前

void StrPrint(HeapString *s);		//输出字符串

---

HeapString.cpp

//HeapString.cpp

#include "malloc.h" //#include "stdlib.h"
#include "HeapString.h"
#include "stdio.h"

void StrInitialize(HeapString *s)
{
	s->ch = '\0';
	s->len = 0;
}

void StrAssign(HeapString *s,char t[])
{
	int i;
	int length=0;
	for(i=0 ; t[i]!='\0' ; i++)
		length++;
	s->ch=(char *)malloc((length+1)*sizeof(char));
	for(i=0 ; i<length ; i++)
		s->ch[i] = t[i];
	s->len = length;
}

int StrInsert(HeapString *s,int pos,HeapString t)
{
	int i;
	char *temp;
	if(pos<0 || pos > s->len+1 || s->len==0)
	{
		printf("Error in inserting position parameter!!\n");
		return 0;
	}
	temp = (char *)malloc(s->len+t.len);
	if(temp==NULL)
		return 0;
	for(i=0 ; i<pos ; i++)
		temp[i] = s->ch[i];
	for(i=0 ; i<t.len ; i++)
		temp[pos+i] = t.ch[i];
	for(i=pos ; i < s->len ; i++)
		temp[i+t.len] = s->ch[i];
	s->len += t.len;
	free(s->ch);
	s->ch = temp;
	return 1;
}

void StrPrint(HeapString *s)
{
	int i;
	for(i=0 ; i < s->len ; i++)
		printf("%c",s->ch[i]);
	putchar(10);
}

---

HeapStringPrj.cpp

//HeapStringPrj.cpp

#include "stdio.h"
#include "HeapString.h"

void main()
{
	HeapString s1,s2;
	StrInitialize(&s1);
	StrInitialize(&s2);

	StrAssign(&s1,"0123456789");
	printf("字符串S:\n");
	StrPrint(&s1);
	putchar(10);

	StrAssign(&s2,"abcdefg");
	printf("字符串T:\n");
	StrPrint(&s2);
	putchar(10);

	StrInsert(&s1,5,s2);
	printf("将T插入到S的下标为5的字符前:\n");
	StrPrint(&s1);

	printf("\nHello\n");
}

---

实验示例

字符串S:
0123456789

字符串T:
abcdefg

将T插入到S的下标为5的字符前:
01234abcdefg56789

Hello
Press any key to continue

---