순서 표 초기 화, 삽입, 삭제

#include
using namespace std;
// - - - -                - - - - 
#define LIST_INIT_SIZE 100  //          
#define INCREMENT 10        //         
#define ElemType char

typedef struct{
    //        
    ElemType *elem;   //       
    int length;       //    
    int listsize;     //         
}SqList;

//       
int InitList_Sq(SqList *L){
    L->elem = (ElemType *)malloc(LIST_INIT_SIZE*sizeof(ElemType));//        
    if (L->elem == NULL)
        return 0;
    L->length = 0;
    L->listsize = LIST_INIT_SIZE;
    return 0;
}

int ListInsert_Sq(SqList *L, int i, ElemType e){
    //    L  i         e
    if (i<1 || i>L->length + 1)
        cout << "i    " << endl;
    if (L->length >= L->listsize){    //      ，    
        ElemType *newbase = (ElemType *)realloc(L->elem, (L->listsize + INCREMENT)*sizeof(ElemType));
        if (newbase = NULL){
            cout << "    " << endl;
            return 0;
        }
        L->elem = newbase;      //    
        L->listsize += INCREMENT;//      
    }
    ElemType *q = &(L->elem[i - 1]);//q     
    for (ElemType *p = &(L->elem[L->length - 1]); p >= q; --p)
        *(p + 1) = *p;    //            

    *q = e; //    
    +L->length; //   1
    return 1;
}

int ListDelete_Sq(SqList *L, int i, ElemType *e){
    //       i   ，  e    
    if (i<1 || i>L->length + 1){          //i     1 length
        cout << "i    " << endl;
        return 0;
    }
    ElemType *p = &(L->elem[i - 1]);  //p          
    *e = *p; // p    e
    ElemType *q = L->elem + L->length - 1;//       
    for (++p; p <= q; ++p)
        *(p - 1) = *p;
    --L->length;
    return 0;
}

int main(){
    SqList L;
    InitList_Sq(&L);
    for (int i = 0; i < 22; i++)
        ListInsert_Sq(&L, 1, 'a' + i);
    ElemType e;
    ListDelete_Sq(&L, 10, &e);
    cout << "      " << e;

    for (int j = 0; j < L.length; j++)
        cout << L.elem[j];
    return 0;
}