严蔚敏《数据结构》——顺序串

顺序串，就是一个数组！！！

串的存储结构

#include<cstdio>
#include<cstdlib>

#define Status char
#define MAXSTRLEN 255     //用户可在255以内定义最大串长
#define TRUE 0
#define FALSE 1
#define OK 0
#define ERROR 1
typedef unsigned char SString[MAXSTRLEN + 1];//0号单元存放串的长度
//将串S1和S2合并成T

将串S1和串S2合并成新的串T

此时

如果S1的长度与S2的长度相加小于或等于T的长度，则不需要截断，即S1+S2=T

如果S1+S2的长度大于T的长度，则需“截断”例如sizeof(T)=5，S1={3,1,2,3}，S2={4,4,5,6,7}那么T={4,1,2,3,4}（S1[0],S2[0]的值为当前串的长度）

如果T的长度和S1的长度相等，那么T=S1。

Status Concat(SString& T, SString S1, SString S2) {
	char uncut;
	S1[0] = sizeof(S1);
	S2[0]=sizeof(S2);
	int length = S1[0] + S2[0];
	if (S1[0] + S2[0] <= MAXSTRLEN) {      //未截断
		T[0] = S1[0] + S2[0];
		for (int i = 1; i < S1[0]; i++) {
			T[i] = S1[i];
		}
		for (int j = S1[0] + 1; j <= length; j++) {
			int k = 1;
			T[j] = S2[k];
			k++;
		}
		printf("未截断！！\n");
		uncut = TRUE;
	}
	else if (S1[0] < MAXSTRLEN) {        //从S2当中某一位置截断
		for (int i = 1; i < S1[0]; i++) {
			T[i] = S1[i];
		}
		for (int j = S1[0] + 1; j <= MAXSTRLEN; j++) {
			int k = 1;
			T[j] = S2[k];
			k++;
		}
		T[0] = MAXSTRLEN;
		printf("在S2中截断！！\n");
		uncut = FALSE;
	}
	else {
		for (int i = 1; i < S1[0]; i++) {
			T[i] = S1[i];
		}
		T[0] = S1[0];
		uncut = FALSE;
	}
}

从S中取子串从第pos的位置起长度为len

Status SunString(SString& Sub, SString S, int pos, int len) {
	if (pos<1 || pos>S[0] || len<0 || len>S[0] - pos + 1) {
		return ERROR;
	}
	for (int i = 1; i < len; i++) {
		Sub[i] = S[pos];
		pos++;
	}
	Sub[0] = len;
}