![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
#线性表
chen_512
这个作者很懒,什么都没留下…
展开
-
循环单链表-头节点
#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>typedef int Elemtype;typedef struct CNode { Elemtype data; struct CNode* next;}CNode,*LinkList;bool List_TailInsert(LinkList& L){ L = (CNode*)malloc(sizeof(CNode));原创 2022-03-24 15:44:05 · 595 阅读 · 0 评论 -
顺序表--静态
顺序表--静态#include<stdio.h>#define MaxSize 5typedef int ElemType;typedef struct List { ElemType data[MaxSize]; int len;}SqList;void InitList(SqList& L){ //可省略因为靠L.len控制访问界限 /*for (int i = 0; i < MaxSize; i++) { L.data[i] = 0; }*/原创 2022-03-16 16:43:21 · 71 阅读 · 0 评论 -
单链表_02_带头结点(自用)
#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>typedef int ElemType;//3 4 5 6 7 9 10 -9999typedef struct LNode { ElemType date; struct LNode* next;}LNode,*Linklist;bool initList(Linklist& L){ L = (LNode *)mallo原创 2022-03-20 10:46:29 · 779 阅读 · 0 评论 -
双链表-简单操作
#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>typedef int ElemType;//3 4 5 6 7 9 10 -9999typedef struct DNode { ElemType Data; struct DNode* prior, * next;}DNode,*DLinklist;void List_length(DLinklist L);bool initiL原创 2022-03-24 15:17:26 · 1015 阅读 · 0 评论 -
单链表 --头插法尾插法(函数中输入)(自用)
#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>//3 4 5 6 7 9 10 -9999typedef int ElemType;typedef struct LNode { ElemType data; struct LNode* next;}LNode,*Linklist;Linklist List_HeadInsert(Linklist& L){ Linklis原创 2022-03-18 10:32:18 · 802 阅读 · 0 评论 -
单链表_不带头结点(自用)
#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>typedef int ElemType;//3 4 5 6 7 9 10 -9999typedef struct LNode { ElemType data; struct LNode* next;}LNode,*Linklist;bool initList(Linklist& L){ L = NULL; return原创 2022-03-21 11:00:06 · 1057 阅读 · 0 评论 -
顺序表--动态
#include<stdio.h>#include<stdlib.h>#define InitSize 10typedef int ElemType;typedef struct { ElemType* data; int MaxSize, len;}SqList;void InitList(SqList& L){ L.data = (ElemType*)malloc(InitSize * sizeof(ElemType)); L.MaxSize = I原创 2022-03-16 16:45:19 · 61 阅读 · 0 评论 -
简易循环双链表-带头结点
#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>typedef int ElemType;typedef struct DCNode { ElemType data; struct DCNode* prior, *next;}DCNode,*LinkList;bool List_TailInsert(LinkList& L){ L = (LinkList)malloc(si原创 2022-03-24 16:25:33 · 1746 阅读 · 0 评论