数据结构2-单链表

目录

一、老师部分

1.完整代码

2.运行结果

 二、自己部分

1.单链表的定义

 2.初始化

 3.插入

 4.删除

 5.前插法 

 6.后插法  

 7.销毁链表

 8.清空链表

一、老师部分

1.完整代码

#include <stdio.h>
#include <malloc.h>

typedef struct LinkNode{
	char date;
	struct LinkNode *next;
} LNode,*LinkList,*NodePtr; 

LinkList initLinkList(){
	NodePtr tempHeader = (NodePtr)malloc(sizeof(LNode));
	tempHeader->date = '\0';
	tempHeader->next = NULL;
	return tempHeader;
}//of initLinkList

void printList(NodePtr paraHeader){
	NodePtr p = paraHeader->next;
	while (p !=NULL){
		printf("%c",p->date);
		p = p->next;
	}//of while
	printf("\r\n");
}//of printList


void appendElement(NodePtr paraHeader,char paraChar){
	NodePtr p,q;
	
	//Step 1.Construct a new node.
	q = (NodePtr)malloc(sizeof(LNode));
	q->date = paraChar;
	q->next = NULL;

    //Step 2. Search to the tail.
    p = paraHeader;
    while(p->next != NULL){
	    p = p->next; 
    }//of while

    //Step3.Now add/link.
    p->next = q;
}//of appendElement


void insertElement(NodePtr paraHeader,char paraChar,int paraPosition){
	NodePtr p,q;
	
	//Step 1.Search to the position.
	p = paraHeader;
	int i;
	for(i = 0;i < paraPosition;i ++){
		p = p->next;
		if (p == NULL){
			printf("The position %d is beyond the scope of the list.",paraPosition);
			return;
		}//of if
	}//of for i
	
	//Step 2.Construct a new node.
	q = (NodePtr)malloc(sizeof(LNode));
	q->date = paraChar;
	
	//Step 3.Now Link.
	printf("linking\r\n");
	q->next = p->next;
	p->next = q;
}//of insertElement


void deleteElement(NodePtr paraHeader,char paraChar){
	NodePtr p,q;
	p = paraHeader;
	while ((p->next != NULL) && (p->next->date !=paraChar)){
		p = p->next;
	}//of while
	
	if(p->next == NULL){
		printf("Cannot delete %c\r\n",paraChar);
		return;
	}//of if
	
	q = p->next;
	p->next = p->next->next;
	free(q);
} //of deleteElement

void appendInsertDeleteTest(){
	//Step 1.Initialize an empty list.
	LinkList tempList = initLinkList();
	printList(tempList);
	
	// Step 2. Add some characters.
	appendElement(tempList,'H');
	appendElement(tempList,'e');
	appendElement(tempList,'l');
	appendElement(tempList,'l');
	appendElement(tempList,'o');
	appendElement(tempList,'!');
	printList(tempList);
	
	//Step 3.Delete some characters(the first occurrence).
	deleteElement(tempList,'e');
	deleteElement(tempList,'a');
	deleteElement(tempList,'o');
	printList(tempList);
	
	//Step 4.Insert to a given position.
	insertElement(tempList,'o',1);
	printList(tempList);
}//of appendInsertDeleteTest


void basicAddressTest(){
	LNode tempNode1,tempNode2;
	
	tempNode1.date = 4;
	tempNode1.next = NULL;
	
	tempNode2.date = 6;
	tempNode2.next = NULL;
	
	printf("The first node: %d, %d, %d\r\n",
	     &tempNode1,&tempNode1.date,&tempNode1.next);
    printf("The second node: %d, %d, %d\r\n",
	&tempNode2,&tempNode2.date,&tempNode2.next);
	
	tempNode1.next = &tempNode2;
}//of basicAddressTest


int main(){
	appendInsertDeleteTest();
	
	return 0;
}//of main

2.运行结果

 

 二、自己部分

1.单链表的定义

     单链表是一种链式存取的数据结构，用一组地址任意的存储单元存放线性表中的数据元素。链表中的数据是以结点来表示的，每个结点的构成：元素(数据元素的映象) + 指针(指示后继元素存储位置)，元素就是存储数据的存储单元，指针就是连接每个结点的地址数据。

 2.初始化

/* 初始化 */
LinkList initLinkList(){
    NodePtr Header = (NodePtr)malloc(sizeof(LNode));
    Header->data = '\0';
    Header->next = NULL;
    return Header;
} 

3.插入

/* 指定位置插入元素 */
void InsertElement(NodePtr paraHeader,char paraChar,int paraPosition){
    NodePtr p, q;

	//找位置
	p = paraHeader;
	for (int i = 0; i < paraPosition; i ++) {
		p = p->next;
		if (p == NULL) {
			printf("The position %d is beyond the scope of the list.", paraPosition);
			return;
		}
	} 

	//插入元素
	q = (NodePtr)malloc(sizeof(LNode));
	q->data = paraChar;

	printf("linking\r\n");
	q->next = p->next;
	p->next = q;
}

 4.删除

/* 删除指定元素 */
void deleteElement(NodePtr paraHeader, char paraChar){
	NodePtr p, q;
	p = paraHeader;
	while ((p->next != NULL) && (p->next->data != paraChar)){
		p = p->next;
	}

	if (p->next == NULL) {
		printf("Cannot delete %c\r\n", paraChar);
		return;
	}

	q = p->next;
	p->next = p->next->next;
	free(q);
}

5.前插法 

/* 随机产生n个元素的值，前插法创建单链表 */
void My_CreatListHeader(LinkList *L,int n）{
     LinkList p;
     int i;
     srand(time(0));//生成n个随机数
     *L = (L*Node)malloc(sizeof(LNode));
    （*L)->next = NULL;
     for(i=0;i<n;i++){
         p=(L*Node)malloc(sizeof(LNode));
         p->data=rand()%100+1;
         p->next=(*L)->next;
         (*L)->next=p;
      }
}

6.后插法 

/* 随机产生n个元素的值，尾插法创建单链表 */
void My_CreateLIstTail(LinkList &L,int n){
    L = (LNode*)malloc(sizeof(LNode));
    L ->next =NULL;   //先建立一个带头结点的空链表
    r = L;            //尾指针r指向头结点
    srand(time(0));   //产生随机数
    for(int i=0;i<n;i++){
    p = (LNode*)malloc(sizeof(LNode));  //生成新结点
    p - > rand()%100 + 1;
    p - >next =NULL;
    r - >next =p;
    r = p;  //r指向尾指针*p
    }
}
      

 7.销毁链表

/* 销毁链表 */
void destroyList(Linklist &L) {
	Linklist p = L;
	while (p)
	{
		L = L->next;
    	free(p);
		delete(p);
		P = L;
	}
}

8.清空链表

/* 清空链表 */
void ClearList(LinkList &L){
    Linklist p;
	while (L->next) {
		p = L->next;
		L->next = p->next;
		delete(p);
}