串的堆分配存储表示与实现（c语言）

小咪咪 2023-07-18 02:34 2阅读 0赞

#include "pch.h"
    #include <stdio.h>
    #include <string>
    
    #define TRUE 1
    #define FALSE 0
    
    /*堆串结构定义*/
    typedef struct { 
    	char *ch;
    	int len;
    }HString;
    
    /*串赋值函数*/
    int StrAssign(HString *s,char *cs) 
    /*将字符常量cs的值赋值给串s*/
    { 
    	int len, i = 0;
    	if (s->ch!=NULL) { 
    		free(s->ch);
    	}
    	while (cs[i] != '\0') { 
    		i++;
    	}
    	len = i;
    	if (len) { 
    		s->ch = (char*)malloc(len);
    		if (s->ch == NULL) { 
    			return FALSE;
    		}
    		for (i = 0; i < len; i++) { 
    			s->ch[i] = cs[i];
    		}
    	}
    	else
    		s->ch = NULL;
    	s->len = len;
    	return TRUE;
    }
    
    /*串插入函数*/
    int StrInsert(HString *s,HString t,int pos) 
    { 
    	int i; char *temp;
    	if (pos < 0||pos>s->len||s->len==0) { 
    		return FALSE;
    	}
    	temp = (char*)malloc(s->len+t.len);
    	if (!temp) { 
    		return FALSE;
    	}
    	for (i = 0; i < pos;i++) { /*字符串s，0到pos-1进行赋值*/
    		temp[i] = s->ch[i];
    	}
    	for (i = 0; i < t.len;i++) { 
    		temp[i + pos] = 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 TRUE;
    }
    
    /*串删除函数*/ 
    int StrDelete(HString *s,int pos,int len) 
    /*在串s中删除从序号pos起的len个字符*/
    { 
    	int i;
    	char *temp;
    	if (pos<0||pos>(s->len-len)) { 
    		return 0;
    	}
    	temp = (char*)malloc(s->len-len);/*借助temp*/
    	if (!temp) { 
    		return NULL;
    	}
    	for (i = 0; i < pos;i++) { 
    		temp[i] = s->ch[i];
    	}
    	for (i = pos; i < s->len - len;i++) { /*数据前移len*/
    		temp[i] = s->ch[i+len];
    	}
    	s->len = s->len - len;
    	free(s->ch);
    	s->ch = temp;/*重新指向temp*/
    	return TRUE;
    }
    
    /*串复制函数*/
    int StrCopy(HString *s,HString t) 
    { 
    	int i;
    	s->ch = (char*)malloc(t.len);
    	if (!s->ch) { 
    		return 0;
    	}
    	for (i = 0; i < t.len;i++) { 
    		s->ch[i] = t.ch[i];
    	}
    	s->len = t.len;
    	return TRUE;
    }
    
    /*判空函数*/
    int StrEmpty(HString s) 
    { 
    	return 0 == s.len ? TRUE : FALSE;
    }
    
    /*串长*/
    int StrLength(HString s) 
    { 
    	return s.len;
    }
    
    /*清空函数*/
    int StrClear(HString *s) 
    { 
    	if (!s->ch) { /*如果s->指向部位NULL，则先释放*/
    		free(s->ch);
    	}
    	s->ch = NULL;
    	s->len = 0;
    	return TRUE;
    }
    
    /*连接函数*/
    int StrCat(HString *s, HString t)
    { 
    	int i;
    	char *temp;
    	temp = (char*)malloc(s->len+t.len);
    	if (!temp) { 
    		return FALSE;
    	}
    	for (i = 0; i < s->len;i++) { 
    		temp[i] = s->ch[i];
    	}
    	for (i = s->len; i < s->len + t.len;i++) { 
    		temp[i] = t.ch[i-s->len];
    	}
    	s->len += t.len;
    	free(s->ch);
    	s->ch = temp;
    	return TRUE;
    }
    
    /*求子串函数*/
    int SubString(HString *sub,HString s,int pos,int len) 
    /*将串s中序号pos起的len个字符复制到sub中*/
    { 
    	int i;
    	if (pos<0||pos>s.len||len<1||len>s.len-pos) { 
    		sub->ch = NULL;
    		sub->len = 0;
    		return FALSE;
    	}
    	else { 
    		sub->ch = (char*)malloc(len);
    		if (!sub->ch) { 
    			return FALSE;
    		}
    		for (i = 0; i < len;i++) { 
    			sub->ch[i] = s.ch[i+pos];
    		}
    		sub->len = len;
    		return TRUE;
    	}
    }
    
    /*定位函数*/
    int StrIndex(HString s,HString t,int pos) 
    { 
    	int i, j;
    	if (s.len==0||t.len==0) { 
    		return FALSE;
    	}
    	i = pos; j = 0;
    	while (i<s.len&&j<t.len) { 
    		if (s.ch[i] = t.ch[i]) { 
    			i++; j++;
    		}
    		else { 
    			i = i - j + 1;
    			j = 0;
    		}
    	}
    	if (j>=t.len) { 
    		return i - j;
    	}
    	else return FALSE;
    }