关于链表的说明与应用
链表属于C语言数据结构,学了数组为什么要学习链表对数据进行操作,简而言之,效率问题。
下面代码中,主要写了创建链表、查找、删除、判断是否是循环链表等等,一些常用功能在这里进行了总结。
包括一些典型的例子,约瑟夫杀人思想、拉丁方阵等
#include<stdio.h>
#include<malloc.h>
#include<string.h>
#include<stdlib.h>
#define OK 1
#define ERROR 0
#define ture 1
#define false 0
//#define YUESEFU
typedef unsigned char bool;
typedef struct node{
int data;
struct node *next;
}Node;
typedef struct list{
Node *first;
Node *last;
int num;
}List;
static List *CreatList(void);
static int AddNodeToList(List *list,int n);
static int PrintfList(List *list);
static int AddNumberToLink(void);
static bool LoopUpNumberInLink(List *list,int *seek);
static int DeleteNumberInLink(List *list,int dele);
static int DeleteNumberAllInLink(List *list,int dele);
static int WriteFileForList(const char *path,List *list);
static bool YUESEFUKillMan(List *list);
static bool IsLinkRing(List *list);
static unsigned int LoopUpRingEntryPoint(List *list);
static unsigned int RingNodeNumber(List *list);
static bool LADINGMatrixProblem(List *list);
int main(int argc,char **argv)
{
List *list = CreatList();
int number = AddNumberToLink(),seek,dele,alldele;
const char path[100] = "C:/Users/80771/Desktop/codeblock/1.txt";
while(number)
{
AddNodeToList(list,number);
number = AddNumberToLink();
}
PrintfList(list);
fprintf(stdout,"请输入要查找的元素\r\n");
scanf("%d",&seek);
LoopUpNumberInLink(list,&seek);
fprintf(stdout,"请输入要删除的元素\r\n");
scanf("%d",&dele);
DeleteNumberInLink(list,dele);
PrintfList(list);
fprintf(stdout,"请输入要删除的全部元素\r\n");
scanf("%d",&alldele);
DeleteNumberAllInLink(list,alldele);
PrintfList(list);
Write