(C/C++) Link List - C 語言版本

基本Link List 用C語言實現

先附上標頭檔

 /**
  * @author      Chen-Hao Lin
  * @email       westgate.skater@gmail.com
  * @website　　　https://www.cnblogs.com/ollie-lin
  * @link　　　　 https://www.cnblogs.com/ollie-lin/p/9927405.html
  * @version     v1.0
  * @ide         CodeBlocks 17.12
  * @license     GUN GCC
  * @brief       link list template
  * @file        Linklist.h
  */

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

 /**
  * @defgroup    Link list node
  * @brief
  * @{
  */

 typedef struct node
 {
     int data;
     struct node * next;
 }Node;

 /**
  * @brief   Create link list.
  * @param   arr: pointer to integer data array. link list data array to assign link list data.
  * @param   size: describe data array size
  * @retval  first link list node.
  */
 Node *CreateList(int *arr, int size);

 /**
  * @brief   Show all of link list.
  * @param   *node: print link list form this node.
  * @retval  None
  */
 void PrintList(Node *node);

 /**
  * @brief   Release link list space.
  * @param   *node: Release link list form this node.
  * @retval  None
  */
 void FreeList(Node *node);

 /**
  * @brief   Search the specific node.
  * @param   *node: Search the specific node form this pointer.
  * @param   data: Search the specific node information.
  * @retval  find the specific node
  */
 Node *SearchNode(Node *node, int data);

 /**
  * @brief   Insert node
  * @param   *node: Insert node after the this param.
  * @param   item: Search data of specific node to insert node.
  * @param   data: The data of Insert node.
  * @retval  None
  */
 void InsertNode(Node *node, int item, int data);

 /**
  * @brief   Before insert node at first node.
  * @param   *node: first node
  * @param   data: The data of Insert node.
  * @retval  first node
  */
 Node *Push_front(Node *node, int data);

 /**
  * @brief   Insert node at last
  * @param   *node: form last node
  * @param   data: The data of last node.
  * @retval  None
  */
 void Push_back(Node *node, int data);

各項功能實做 Create List

 Node * CreateList(int *arr, int size)
 {
     if(arr ==  || size == )
         return NULL;

     Node *previous, *first;
     for(int i = ; i < size; i++)
     {
         Node *current = (Node*)malloc(sizeof(Node));
         current->data = arr[i];

         if(i == )
             first = current;
         else{
             previous->next = current;
         }
         current->next = NULL;
         previous = current;
     }
     return first;
 }

PrintList

 void PrintList(Node *node)
 {
     if(node == ){
         printf("List is empty.\n");
         return;
     }

     Node *current = node;
     while(current)
     {
         printf("%d  ", current->data);
         current = current->next;
     }
     printf("\n");
 }

Release List

 void FreeList(Node *node)
 {
     Node *current, *temp;
     current = node;
     while(current)
     {
         temp = current;
         current = current->next;
         free(temp);
     }
 }

Search node

 Node *SearchNode(Node *node, int data)
 {
     Node *temp = node;
     while(temp)
     {
         if(temp->data == data)
             return temp;
         else
             temp = temp->next;
     }
     return NULL;
 }

Insert node

 void InsertNode(Node *node, int item, int data)
 {
     Node *current = node;
     Node *previous = (Node*)malloc(sizeof(Node));
     Node *newNode = (Node*)malloc(sizeof(Node));
     while(current)
     {
             if(current->data == item)
             {
                 newNode->data = data;
                 previous->next = newNode;
                 newNode->next = current;
                 break;
             }
             else
             {
                 previous = current;
                 current = current->next;
             }
     }
 }

push front/back node

 Node* Push_front(Node *node, int data)
 {
     Node *temp = (Node*)malloc(sizeof(Node));
     temp->data = data;
     temp->next = node;
     node->next = node->next;
     return temp;
 }

 void Push_back(Node *node, int data)
 {
     Node *newNode = (Node*)malloc(sizeof(Node));
     newNode->data = data;
     while(node->next)
     {
         node = node->next;
     }
     node->next = newNode;
     newNode->next = NULL;
 }