随笔分类 - 数据结构c语言版
6.带头结点的单链表操作
摘要：#include<stdio.h>#include<stdlib.h>typedef int ElemType; typedef struct LNode{ ElemType data; struct LNode *next; }LNode,*LinkList;LNode * GetElem(Lin
阅读全文
5.顺序表的按位和按值查找
摘要：#include <stdio.h>#include <stdlib.h>#define InitSize 10 typedef int ElemType;typedef struct{ int *data; int MaxSize; int length;}SqList; void InitLis
阅读全文
4.顺序表的删除
摘要：#include <stdio.h>#define MaxSize 10typedef int ElemType;typedef struct{ int data[10]; int length;}SqList; void InitList(SqList &L){ for(int i=0;i<Max
阅读全文
3.顺序表的插入
摘要：#include <stdio.h>#define MaxSize 10typedef int ElemType;typedef struct{ int data[10]; int length;}SqList; void InitList(SqList &L){ for(int i=0;i<Max
阅读全文
2.顺序表的定义(动态)
摘要：#include <stdio.h>#include <stdlib.h>#define InitSize 10 typedef int ElemType;typedef struct{ int *data; int MaxSize; int length;}SqList; void InitLis
阅读全文
1.顺序表的定义
摘要：#include <stdio.h>#define MaxSize 10typedef int ElemType;typedef struct{ int data[10]; int length;}SqList; void InitList(SqList &L){ for(int i=0;i<Max
阅读全文
