【整理】單鏈表的初始化，創建，插入，刪除和反轉

單鏈表的初始化，創建，插入，刪除和反轉

#include<stdio.h>
#include<stdlib.h>

typedef int Elemtype;
typedef struct Node
{
    Elemtype data;
    struct Node *next;
}Node, *LinkedList;

//單鏈表的初始化
LinkedList LinkedListInit()
{
    Node *L;
    L = (Node*)malloc(sizeof(Node));
    if (L == NULL)
    {
        printf("申請內存空間失敗\n");
    }
    L->next = NULL;
    return L;
}

//單鏈表的創建一：頭插法建立單鏈表
LinkedList LinkedListCreatH()
{
    Node *L;
    L = (Node *)malloc(sizeof(Node));
    L->next = NULL;

    Elemtype x;
    while (scanf("%d", &x) != EOF)
    {
        Node *p;
        p = (Node *)malloc(sizeof(Node));
        p->data = x;
        p->next = L->next;
        L->next = p;
    }
    return L;
}

//單鏈表的創建二：尾插法建立單鏈表
LinkedList LinkedListCreatT()
{
    Node *L;
    L = (Node *)malloc(sizeof(Node));
    L->next = NULL;

    Node *r;
    r = L;
    Elemtype x;
    while (scanf("%d", &x) != EOF)
    {
        Node *p;
        p = (Node *)malloc(sizeof(Node));
        p->data = x;
        //p->next = NULL;
        r->next = p;
        r = p;
    }
    r->next = NULL;
    return L;
}

//單鏈表的插入，在鏈表的第i個位置插入x的元素
//要在第i個位置插入，就得先找到第(i-1)個位置，插在它后面
LinkedList LinkedListInsert(LinkedList L, int i, Elemtype x)
{
    Node *pre;
    pre = L;
    int tempi = 0;
    for (tempi = 1; tempi < i; tempi++)
        pre = pre->next;
    Node *p;
    p = (Node *)malloc(sizeof(Node));
    p->data = x;
    p->next = pre->next;
    pre->next = p;
    return L;
}

//單鏈表的刪除，在鏈表中刪除第一個值為x的元素
LinkedList LinkedListDelete(LinkedList L, Elemtype x)
{
    Node *pre, *p;
    p = L->next;
    while (p->data != x)
    {
        pre = p;
        p = p->next;
    }
    pre->next = p->next;
    free(p);
    return L;
}

//單鏈表的反轉
LinkedList LinkedListReverse(LinkedList L)
{

    Node *rhead = NULL;
    Node *prev = NULL;
    Node *p = L->next;//如果原鏈表的頭是一個結點，結點的內容為任意值，p要指向頭的下一個結點才是鏈表的第一個值
    //Node *p = L;//如果原鏈表的頭是一個指針，p直接等於Lj就可以了，L指的就是鏈表的第一個值
    Node *pnext = NULL;
    while (p != NULL)
    {
        pnext = p->next;
        if (pnext == NULL)
            rhead = p;
        p->next = prev;
        prev = p;
        p = pnext;
    }
    free(L);
    return rhead;    
}

int main()
{
    LinkedList list, start;

    //單鏈表的創建一：頭插法建立單鏈表
    printf("請輸入單鏈表的數據：");
    list = LinkedListCreatH();
    for (start = list->next; start != NULL; start = start->next)
        printf("%d", start->data);
    printf("\n");

    //單鏈表的創建二：尾插法建立單鏈表
    printf("請輸入單鏈表的數據：");
    list = LinkedListCreatT();
    for (start = list->next; start != NULL; start = start->next)
        printf("%d", start->data);
    printf("\n");

    //單鏈表的插入，在鏈表的第i個位置插入x的元素
    int i,x;
    printf("請輸入插入數據的位置：");
    scanf("%d", &i);
    printf("請輸入插入數據的值：");
    scanf("%d", &x);
    LinkedListInsert(list, i, x);
    for (start = list->next; start != NULL; start = start->next)
        printf("%d", start->data);
    printf("\n");

    //單鏈表的刪除，在鏈表中刪除第一個值為x的元素
    printf("請輸入要刪除的元素的值：");
    scanf("%d", &x);
    LinkedListDelete(list, x);
    for (start = list->next; start != NULL; start = start->next)
        printf("%d", start->data);
    printf("\n");

    //單鏈表的反轉
    Node *rhead;
    rhead=LinkedListReverse(list);
    for (start = rhead; start != NULL; start = start->next)
        printf("%d", start->data);
    printf("\n");

    system("pause");
    return 0;
}
//注意：結束輸入的時候連續輸入三個ctrl+z

運行結果：

注意：在VS2015環境下，需要輸入三個ctrl+z才能結束while中的scanf；在VC++6.0中一個ctrl+z就可以結束。

 

——如有不對的地方，非常歡迎給予指導！

——【感謝】部分資料來源於http://blog.csdn.net/m_zhurunfeng/article/details/54809821

——【感謝】部分資料來源於《劍指OFFER》