單向加頭連結串列的[構建、插入、刪除、查詢、輸出]

#include <stdio.h>
#include <malloc.h>
typedef struct lianbiao *ptr;
struct lianbiao
{
    int data;
    ptr next;
};

int main(void)
{
    ptr create();
    void out(ptr p);
    ptr search(ptr p, int x);
    ptr del(ptr h, int x);
    ptr add(ptr head, int x);
    int delEl, searchEl, addEl, delResult, searchResult;

    ptr l = create(); //構建初始連結串列

    printf("初始連結串列為:"); //輸出初始連結串列
    out(l);
    printf("\n");

    //查詢元素
    printf("輸入待查詢元素:");
    scanf("%d", &searchEl);

    searchResult = search(l, searchEl);
    if (searchResult)
    {
        searchResult = search(l, searchEl)->data;
        printf("元素%d查詢成功\n", searchResult);
    }

    else
        printf("待查詢元素不存在！\n");
    printf("\n");

    //刪除元素
    printf("輸入待刪除元素:");
    scanf("%d", &delEl);
    delResult = del(l, delEl);
    if (delResult)
        printf("刪除成功！\n");
    else
        printf("待刪除元素不存在！\n");
    printf("\n");

    //插入元素
    printf("輸入待插入元素:");
    scanf("%d", &addEl);
    add(l, addEl);
}

ptr create() // 構建連結串列
{
    ptr p, head, last;
    int x;
    //建立頭結點
    head = (ptr)malloc(sizeof(ptr));
    head->data = 0;
    last = head;
    last->next = NULL;

    //新增連結串列元素
    printf("構建初始連結串列(輸入0以結束):");
    scanf("%d", &x);
    while (x != 0)
    {
        p = (ptr)malloc(sizeof(ptr));
        p->data = x;

        //把新元素插入連結串列
        if (x > last->data) //待插入元素大於所有節點
        {
            last->next = p;
            p->next = NULL;
            last = p;
        }
        else if (x < head->next->data) //待插入元素小於所有節點
        {
            p->next = head->next;
            head->next = p;
        }
        else //一般情況
        {
            ptr f = head, s = f->next;
            while (x > s->data)
            {
                f = s;
                s = s->next;
            }
            p->next = s;
            f->next = p;
        }

        scanf("%d", &x);
    }
    return head;
}

void out(ptr p) //輸出連結串列
{
    p = p->next;
    while (p != NULL)
    {
        printf("%5d", p->data);
        p = p->next;
    }
    printf("\n");
};

ptr search(ptr p, int x) //搜尋元素
{
    while (p != NULL)
    {
        if (p->data == x)
            return p;
        p = p->next;
    }
    return 0;
}

ptr del(ptr h, int x) //刪除元素
{
    ptr f, s;
    f = h;
    s = h->next;
    while (s->data != x)
    {
        f = s;
        s = s->next;
        if (s->next == NULL)
            break;
    }

    if (s->data == x)
    {
        f->next = s->next;
        free(s);
        return 1;
    }
    else
        return 0;
}

ptr add(ptr head, int x)
{
    ptr p, last, yyy;
    yyy = head;
    while (yyy->next != NULL)
        yyy = yyy->next;
    last = yyy;
    last->next = NULL;

    p = (ptr)malloc(sizeof(ptr));
    p->data = x;

    //把新元素插入連結串列
    if (x > last->data) //待插入元素大於所有節點
    {
        last->next = p;
        p->next = NULL;
        last = p;
    }
    else if (x < head->next->data) //待插入元素小於所有節點
    {
        p->next = head->next;
        head->next = p;
    }
    else //一般情況
    {
        ptr f = head, s = f->next;
        while (x > s->data)
        {
            f = s;
            s = s->next;
        }
        p->next = s;
        f->next = p;
    }

    printf("新增完成！\n現在的連結串列為:");
    out(head);
    printf("\n");
}

 

#include <stdio.h>#include <malloc.h>typedef struct lianbiao *ptr;struct lianbiao{    int data;    ptr next;};
int main(void){    ptr create();    void out(ptr p);    ptr search(ptr p, int x);    ptr del(ptr h, int x);    ptr add(ptr head, int x);    int delEl, searchEl, addEl, delResult, searchResult;
    ptr l = create(); //構建初始連結串列
    printf("初始連結串列為:"); //輸出初始連結串列    out(l);    printf("\n");
    //查詢元素    printf("輸入待查詢元素:");    scanf("%d", &searchEl);
    searchResult = search(l, searchEl);    if (searchResult)    {        searchResult = search(l, searchEl)->data;        printf("元素%d查詢成功\n", searchResult);    }
    else        printf("待查詢元素不存在！\n");    printf("\n");
    //刪除元素    printf("輸入待刪除元素:");    scanf("%d", &delEl);    delResult = del(l, delEl);    if (delResult)        printf("刪除成功！\n");    else        printf("待刪除元素不存在！\n");    printf("\n");
    //插入元素    printf("輸入待插入元素:");    scanf("%d", &addEl);    add(l, addEl);}
ptr create() // 構建連結串列{    ptr p, head, last;    int x;    //建立頭結點    head = (ptr)malloc(sizeof(ptr));    head->data = 0;    last = head;    last->next = NULL;
    //新增連結串列元素    printf("構建初始連結串列(輸入0以結束):");    scanf("%d", &x);    while (x != 0)    {        p = (ptr)malloc(sizeof(ptr));        p->data = x;
        //把新元素插入連結串列        if (x > last->data) //待插入元素大於所有節點        {            last->next = p;            p->next = NULL;            last = p;        }        else if (x < head->next->data) //待插入元素小於所有節點        {            p->next = head->next;            head->next = p;        }        else //一般情況        {            ptr f = head, s = f->next;            while (x > s->data)            {                f = s;                s = s->next;            }            p->next = s;            f->next = p;        }
        scanf("%d", &x);    }    return head;}
void out(ptr p) //輸出連結串列{    p = p->next;    while (p != NULL)    {        printf("%5d", p->data);        p = p->next;    }    printf("\n");};
ptr search(ptr p, int x) //搜尋元素{    while (p != NULL)    {        if (p->data == x)            return p;        p = p->next;    }    return 0;}
ptr del(ptr h, int x) //刪除元素{    ptr f, s;    f = h;    s = h->next;    while (s->data != x)    {        f = s;        s = s->next;        if (s->next == NULL)            break;    }
    if (s->data == x)    {        f->next = s->next;        free(s);        return 1;    }    else        return 0;}
ptr add(ptr head, int x){    ptr p, last, yyy;    yyy = head;    while (yyy->next != NULL)        yyy = yyy->next;    last = yyy;    last->next = NULL;
    p = (ptr)malloc(sizeof(ptr));    p->data = x;
    //把新元素插入連結串列    if (x > last->data) //待插入元素大於所有節點    {        last->next = p;        p->next = NULL;        last = p;    }    else if (x < head->next->data) //待插入元素小於所有節點    {        p->next = head->next;        head->next = p;    }    else //一般情況    {        ptr f = head, s = f->next;        while (x > s->data)        {            f = s;            s = s->next;        }        p->next = s;        f->next = p;    }
    printf("新增完成！\n現在的連結串列為:");    out(head);    printf("\n");}