선형 순서 표

#include 
#include 
#define MAXLISTSIZE 1024 //    


//        
typedef struct {
    int data[MAXLISTSIZE];//          ,int   
    int last;//       
}LinearList;

LinearList* list;//    LinearList*

void showList();
void outputDoc();
LinearList* createLinearList();
void appendNode();
void insertNode();
void delNode();
void operate();

void showList(LinearList* l) {
    printf("          :
");
    if(l->last == 0) {
        printf("        null");
    } else {

        int i;
        for(i = 0; i < (l->last); i++) {
            printf("[%d]\t",l->data[i]);
        }
    } 
    printf("
");
}

//      
void outputDoc() {
    system("cls");
    printf("       :
");
    printf("a:      ;       i:      
");
    printf("d:      ;       e:  
");
}

//       
LinearList* createLinearList() {
    LinearList* list = (LinearList*)malloc(sizeof(LinearList));//  LinearList       ,    LinearList    
    list->last = 0;//     (  )   
    return list; 
} 



//    
void appendNode(LinearList* list, int data) {
    if((list->last) < MAXLISTSIZE) {
        list->data[list->last] = data;
        list->last ++;
    }
} 

//    ,       ,                
void insertNode(LinearList* list, int data, int pos) {

    if(pos < 0 || pos > list->last || list->last == MAXLISTSIZE) {
        char ch;
        printf("        !,q     !
");
        while(1) {
            ch = getchar();
            if(ch == 'q') {
                operate();
            }
        }

    } else {
        int j;
        for(j = list->last; j >= pos; j--) {    //j >= pos , pos        
            list->data[j+1] = list->data[j];    //       +1
        }
        list->data[pos] = data;     //     0  ,
        list->last++;
    } 
} 

//    
void delNode(LinearList* list,int pos){
    if(pos < 0 || pos > list->last) {
        printf("            !");
    } else {
        int j;
        for(j = pos; j < list->last; j++) { //j < list.last 
            list->data[j] = list->data[j+1];
        } 
        list->last--; 
    } 
}

//    
void operate(){
    int data,pos;
     char ch;
        while(1) {
        outputDoc();
        showList(list);
        ch = getchar();
        switch(ch) {
            case 'a':
                printf("     :
");
                scanf("%d",&data);
                appendNode(list,data);
                break;
            case 'i':
                printf("         :
");
                scanf("%d",&pos);
                printf("         :
");
                scanf("%d",&data);
                insertNode(list,data,pos);
                break;
            case 'd':
                printf("           :
");
                scanf("%d",&pos);
                delNode(list,pos);
                break;
            case 'e':
                system("exit");
                break;
            default:
                printf("    !
");
                break;
         }
     }
}


//    
int main() {
     list = createLinearList();
     operate();
     return 0;
}