程式功能：建立一個帶有頭結點的單向連結串列，並將儲存在陣列中的字元依次轉儲到連結串列的各個結點中。
阿新 • • 發佈：2019-02-07
#include <stdio.h>
#include <stdlib.h>
struct node
{
int num;
struct node *next;
};
typedef struct node Node;
typedef struct node *Link;
void CreatLink(Link *head)
{
*head = NULL;
}
void IsMallocOk(Link new_node)
{
if (new_node == NULL)
{
printf ("No enough memory to allocate!\n");
exit(-1);
}
}
void CreatNewnode(Link *new_node)
{
*new_node = (Link)malloc(sizeof(Node));
IsMallocOk(*new_node);
}
void InsertNodeTail(Link *head, Link new_node)
{
Link temp;
temp = *head;
if (*head == NULL)
{
new_node -> next = *head; //若原連結串列為空表，那麼新建節點置為頭節點
*head = new_node;
}
else
{
while (temp -> next != NULL)
{
temp = temp -> next; //若原連結串列為非空，那麼移動temp直到指向表尾
}
temp -> next = new_node;
new_node -> next = NULL; //讓末節點的指標域指向新建節點
}
}
void DisplayNode(Link head) //列印連結串列節點
{
Link temp;
temp = head;
while (temp != NULL)
{
printf ("%d ", temp -> num);
temp = temp -> next;
}
printf ("\n");
}
int main()
{
int Arr[] = {1,3,2,16,5,4,65,36,7,10}; //初始化一個數組
Link head = NULL;
Link new_node = NULL;
int i = 0;
CreatLink(&head); //建立一個頭節點
for (i = 0; i < 10; i++)
{
CreatNewnode(&new_node); //建立新的節點
new_node -> num = Arr[i]; //將陣列的資料寫入節點
InsertNodeTail(&head, new_node);
}
DisplayNode(head);
return 0;
}
#include <stdlib.h>
struct node
{
int num;
struct node *next;
};
typedef struct node Node;
typedef struct node *Link;
void CreatLink(Link *head)
{
*head = NULL;
}
void IsMallocOk(Link new_node)
{
if (new_node == NULL)
{
printf ("No enough memory to allocate!\n");
exit(-1);
}
}
void CreatNewnode(Link *new_node)
{
*new_node = (Link)malloc(sizeof(Node));
IsMallocOk(*new_node);
}
void InsertNodeTail(Link *head, Link new_node)
{
Link temp;
temp = *head;
if (*head == NULL)
{
new_node -> next = *head; //若原連結串列為空表，那麼新建節點置為頭節點
*head = new_node;
}
else
{
while (temp -> next != NULL)
{
temp = temp -> next; //若原連結串列為非空，那麼移動temp直到指向表尾
}
temp -> next = new_node;
new_node -> next = NULL; //讓末節點的指標域指向新建節點
}
}
void DisplayNode(Link head) //列印連結串列節點
{
Link temp;
temp = head;
while (temp != NULL)
{
printf ("%d ", temp -> num);
temp = temp -> next;
}
printf ("\n");
}
int main()
{
int Arr[] = {1,3,2,16,5,4,65,36,7,10}; //初始化一個數組
Link head = NULL;
Link new_node = NULL;
int i = 0;
CreatLink(&head); //建立一個頭節點
for (i = 0; i < 10; i++)
{
CreatNewnode(&new_node); //建立新的節點
new_node -> num = Arr[i]; //將陣列的資料寫入節點
InsertNodeTail(&head, new_node);
}
DisplayNode(head);
return 0;
}