선형 표싱글 체인 시트 의 기본 조작

typedef int ElementType;
typedef  struct LNode* LinkList;
typedef  struct LNode* PtrToNode;
typedef struct LNode
{
    ElementType data;
    PtrToNode next;
} LNode;

LinkList CreateLinkList(int n);     //     n    
PtrToNode FindByPos(LinkList l, int pos);   //          
PtrToNode FindByValue(LinkList l, ElementType value);   //         
void Insert(LinkList l, ElementType x, int pos);    //       
void Delete(LinkList l, int pos);   //        

LinkList CreateLinkList(int n){

    LinkList l;
    PtrToNode tmpCell, tail;

    l = (LinkList*)malloc(sizeof(LNode));
    l->next = NULL;

    ElementType data;
    for(int i = 0; i < n; i++){
        scanf("%d", &data);
        tmpCell = (PtrToNode)malloc(sizeof(LNode));
        tmpCell->data = data;
        tmpCell->next = NULL;

        if(i == 0)
            l->next = tmpCell;
        else
            tail->next = tmpCell;
        tail = tmpCell;
    }
    return l;
}

PtrToNode FindByPos(LinkList l, int pos)
{

    int i = 1;
    LinkList p = l->next;

    while(p && i < pos)
    {
        p = p->next;
        i++;
    }

    if(i == pos)
        return p;
    return NULL;
}

PtrToNode FindByValue(LinkList l, ElementType value)
{

    LinkList p = l->next;
    while(p && p->data != value)
        p = p->next;
    return p;
}

void Insert(LinkList l, ElementType x, int pos)
{
    PtrToNode node = (PtrToNode)malloc(sizeof(LNode));
    node->data = x;
    node->next = NULL;

    if(pos == 1)
    {
        node->next = l->next;
        l->next = node;
    }
    else
    {
        PtrToNode pre = FindByPos(l, pos - 1);
        if(!node)
            return;
        else
        {
            node->next = pre->next;
            pre->next = node;
        }
    }
}

void Delete(LinkList l, int pos){

    PtrToNode tmpCell;

    if(pos == 1){
        tmpCell = l->next;
        l->next = tmpCell->next;
    }
    else{
        PtrToNode pre = FindByPos(l, pos - 1);
        if(!pre || !pre->next)
            return;
        else{
            tmpCell = pre->next;
            pre->next = tmpCell->next;
        }
    }

    free(tmpCell);
    tmpCell = NULL;
}