C/C++編程筆記：連接列表（鏈表）丨刪除節點的操做源碼

時間 2020-12-13

標籤 node c++ 編程微信學習 spa 3d code 視頻 blog 欄目 C&C++ 简体版

原文原文鏈接

咱們已經在之前關於單連接列表的文章中討論了「連接列表介紹」和「連接列表插入」。node

讓咱們制定問題陳述以瞭解刪除過程。給定一個「鍵」，刪除該鍵在鏈表中的第一個匹配項。 c++

要從連接列表中刪除節點，咱們須要執行如下步驟。編程

1）找到要刪除的節點的上一個節點。微信

2）更改上一個節點的下一個節點。學習

3）待刪除節點的可用內存。spa

因爲鏈表的每一個節點都是使用C語言中的malloc（）動態分配的，所以咱們須要調用free（）來釋放爲要刪除的節點分配的內存。3d

C ++code

    #include <bits/stdc++.h>

    usingnamespacestd;

    classNode{

    public:

        intdata;

        Node* next;

    };

    voidpush(Node** head_ref, intnew_data)

    {

        Node* new_node = newNode();

        new_node->data = new_data;

        new_node->next = (*head_ref);

        (*head_ref) = new_node;

    }

    voiddeleteNode(Node** head_ref, intkey)

    {

        Node* temp = *head_ref;

        Node* prev = NULL;

        if(temp != NULL && temp->data == key)

        {

            *head_ref = temp->next; 

            delete temp;           

            return;

        }

        while(temp != NULL && temp->data != key)

        {

            prev = temp;

            temp = temp->next;

        }

        if(temp == NULL)

            return;

        prev->next = temp->next;

        delete temp;

    }

    voidprintList(Node* node)

    {

        while(node != NULL) 

        {

            cout << node->data << " ";

            node = node->next;

        }

    }

    intmain()

    {

        Node* head = NULL;

        push(&head, 7);

        push(&head, 1);

        push(&head, 3);

        push(&head, 2);

        puts("Created Linked List: ");

        printList(head);

        deleteNode(&head, 1);

        puts("\nLinked List after Deletion of 1: ");

        printList(head);

        return 0;

    }

C語言視頻

    #include <stdio.h>

    #include <stdlib.h>

    structNode

    {

        intdata;

        structNode *next;

    };

    voidpush(structNode** head_ref, intnew_data)

    {

        structNode* new_node = (structNode*) malloc(sizeof(structNode));

        new_node->data  = new_data;

        new_node->next = (*head_ref);

        (*head_ref)    = new_node;

    }

    voiddeleteNode(structNode **head_ref, intkey)

    {

        structNode* temp = *head_ref, *prev;

        if(temp != NULL && temp->data == key)

        {

            *head_ref = temp->next;  

            free(temp); 

            return;

        }

        while(temp != NULL && temp->data != key)

        {

            prev = temp;

            temp = temp->next;

        }

        if(temp == NULL) return;

        prev->next = temp->next;

        free(temp);  

    }

    voidprintList(structNode *node)

    {

        while(node != NULL)

        {

            printf(" %d ", node->data);

            node = node->next;

        }

    }

    int main()

    {

        structNode* head = NULL;

        push(&head, 7);

        push(&head, 1);

        push(&head, 3);

        push(&head, 2);

        puts("Created Linked List: ");

        printList(head);

        deleteNode(&head, 1);

        puts("\nLinked List after Deletion of 1: ");

        printList(head);

        return0;

    }