//通过三种不同的单链表创建方法对 单链表的学习 进行理解
//关键是弄清楚指针的指向,即可较简单的对整个代码理解
#include<iostream>
#include<malloc.h>#include<assert.h>
#define ElemType int
typedef struct ListNode
{
ElemType data;
struct ListNode*next;
}ListNode;
typedef ListNode *list;
//第一部分 尾插法
/*
void InitList(list *head)//相当于 ListNode **head
{
(*head) = NULL;//注意这里是(*head);不是(*head)->
}
void CreateList(list *head)//创建单链表(尾插法)
{
(*head) = (ListNode *)malloc(sizeof(ListNode));
assert(*head != NULL);
(*head)->data = 1;
(*head)->next = NULL;
ListNode *p = *head;
for (int i = 2; i <= 10; i++)
{
ListNode *s = (ListNode *)malloc(sizeof(ListNode));
assert(s != NULL);
s->data = i;
s->next = NULL;
p->next = s;//在这里注意结合图来理解指针的变化
p = s;
}
void ShowList(ListNode *head)
{
while (head != NULL)
{
cout << head->data << "--> ";
head = head->next;
}
cout << "Nul." << endl;
}
*/
//第二部分 头插法
/*
void InitList(list *head)//相当于 ListNode **head
{
(*head) = NULL;//注意这里是(*head);不是(*head)-> !
}
void CreateList(list *head)//单链表的创建(头插法)
{
(*head) = (ListNode *)malloc(sizeof(ListNode));
assert(*head != NULL);
(*head)->data = 1;
(*head)->next = NULL;
for (int i = 2; i <= 10; i++)
{
ListNode *s = (ListNode *)malloc(sizeof(ListNode));
assert(s != NULL);
s->data = i;//注意这里接下来的两条语句
s->next = *head;
*head = s;
}
}
void ShowList(ListNode *head)
{
while (head != NULL)
{
cout << head->data << "--> ";
head = head->next;
}
cout << "Nul." << endl;
}
*/
//第三部分 拥有 头结点 的 头插法; 区分第一二部分中 初始化 与第三部分的区别
void InitList(list *head)
{
(*head) = (ListNode *)malloc(sizeof(ListNode));
assert(*head != NULL);
(*head)->next = NULL;
}
void CreateList(list *head)
{
for (int i = 1; i <= 10; i++)
{
ListNode *s = (ListNode *)malloc(sizeof(ListNode));
assert(s != NULL);
s->data = i;
s->next = (*head)->next;
(*head)->next = s;
}
}
void ShowList(ListNode *head)
{
ListNode *p = head->next;
while (p != NULL)
{
cout << p->data << "--> ";
p = p->next;
}
cout << "Nul." << endl;
}
void main()
{
list mylist;
InitList(&mylist);//初始化单链表
CreateList(&mylist);
ShowList(mylist);
}