《串---定长顺序存储结构》

//定长顺序存储表示
/*
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define INFEASIBLE -1
#define OVERFLOW -2
#define MAXSTRLEN 255                            //可在255以内定义最大串长
typedef int Status;
typedef unsigned char SString[MAXSTRLEN+1];        //0号单元存放串的长度
//串赋值
Status StrAssign(SString &S,char *chars)
{
    int i;
    if(strlen(chars)>MAXSTRLEN)
        return ERROR;
    else
    {
        S[0] = strlen(chars);
        for(i=1;i<=S[0];i++)
            S[i] = *(chars+i-1);
        return OK;
    }
}
//求串长
int StrLength(SString S)
{
    return S[0];
}
//输出字符串
void StrPrint(SString S)
{
    int i;
    for(i=1;i<=S[0];i++)
        printf("%c",S[i]);
    printf("\n");
}
//求子串
Status SubString(SString &Sub,SString S,int pos,int len)
{//用Sub返回串S的第pos个字符起长度为len的子串。
    //其中，1<=pos<=Strlength(S)且0<=len<=StrLength(S)-pos+1。
    int i;
    if(pos<1 || pos>S[0] || len<0 || len>S[0]-pos+1)
        return ERROR;
    for(i=1;i<=len;i++)
        Sub[i] = S[pos+i-1];
    Sub[0] = len;
    return OK;
}
//串连接
Status Concat(SString &T,SString S1,SString S2)
{//用T返回由S1和S2连接成的新串。若未截断，则返回TRUE,否则返回FALSE.
    int i;
    if(S1[0]+S2[0] <= MAXSTRLEN)
    {//未截断
        for(i=1;i<=S1[0];i++)
            T[i] = S1[i];
        for(i=1;i<=S2[0];i++)
            T[S1[0]+i] = S2[i];
        T[0]=S1[0]+S2[0];
        return TRUE;
    }
    else 
    {//截断
        for(i=1;i<S1[0];i++)
            T[i] = S1[i];
        for(i=1;i<=MAXSTRLEN-S1[0];i++)
            T[S1[0]+i] = S2[i];
        T[0] = MAXSTRLEN;
        return FALSE;
    }
}
//串比较
Status StrCompare(SString S,SString T)
{//若S>T,则返回值>0;若S=T,则返回值=0;若S<T,则返回值<0。
    int i;
    for(i=1;i<=S[0]&&i<=T[0];++i)
        if(S[i]!=T[i])
            return S[i] - T[i];
        else
            return S[0] - T[0];
}
int main()
{
    int i,j,opp=1;
    char s;
    SString t,s1,s2,sub;
    Status k;
    printf("\n1，StrAssign 生成串\n2,StrLength 求串长\n3,串比较\n");
    printf("4,Concat 串连接\n5,SubString 求子串\n");
    printf("0,退出\n请选择你的操作:\n");
    
    while(opp!=0)
    {
        scanf("%d",&opp);
        switch(opp)
        {
        case 1:
            k=StrAssign(s1,"DOorDIE");
            if(!k)
            {
                printf("串长超过MAXSTRLEN(=%d)\n",MAXSTRLEN);
                exit(0);
            }
            printf("串s1为：");
            StrPrint(s1);
            printf("\n");
            break;
        case 2:
            printf("串长为%d\n",StrLength(s1));
            break;
        case 3:
            k = StrAssign(s2," YOUCAN");
            if(!k)
            {
                printf("串长超过MAXSTRLEN(=%d)\n",MAXSTRLEN);
                exit(0);
            }
            printf("串s2为：");
            StrPrint(s2);
            printf("\n");
            i = StrCompare(s1,s2);
            if(i<0)
                s='<';
            else if(i==0)
                s='=';
            else
                s='>';
            printf("串s1%c串s2\n",s);
            break;
        case 4:
            Concat(t,s1,s2);
            StrPrint(t);
            break;
        case 5:
            printf("求串s1的子串，请输入子串的起始位置：");
            scanf("%d",&i);
            printf("请输入子串的长度：");
            scanf("%d",&j);
            printf("起始位置：%d,子串长度：%d",i,j);
            k = SubString(sub,s1,i,j);
            if(k)
            {
                printf("子串sub为：");
                StrPrint(sub);
            }
            break;
        case 0:
            exit(0);
        }
    }
}*/