![](https://img-blog.csdnimg.cn/20201014180756916.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
数据结构
weixin_45293600
这个作者很懒,什么都没留下…
展开
-
顺序查找折半查找
#include <iostream># define MaxSize 100using namespace std;typedef struct{ int data[MaxSize]; int length;}SqList;void InitList(SqList &L){ L.length=0;}bool ListInsert(SqList &L,int i,int e){ if(i<1 || i>L.length+1原创 2021-09-07 17:13:18 · 57 阅读 · 0 评论 -
从顺序表删除给定值s,t之间的数
#include <iostream>#define MaxSize 100using namespace std;typedef struct{ int data[MaxSize]; int length;}SqList;void InitList(SqList &L){ L.length=0;}bool ListInsert(SqList &L,int i,int e){ if(i<1 || i>L.length+1)原创 2021-08-17 18:40:03 · 150 阅读 · 0 评论 -
顺序表逆置
#include <iostream>#define MaxSize 100using namespace std;typedef struct{ int data[MaxSize]; int length;}SqList;void InitList(SqList &L){ L.length=0;}bool ListInsert(SqList &L,int i,int e){ if(i<1 || i>L.length+1)原创 2021-08-17 18:21:25 · 53 阅读 · 0 评论 -
删除顺序表最小元素
#include <iostream>#define MaxSize 100using namespace std;typedef struct{ int data[MaxSize]; int length;}SqList;void InitList(SqList &L){ L.length=0;}bool ListInsert(SqList &L,int i,int e){ if(i<1 || i>L.length+1)原创 2021-08-17 18:09:56 · 61 阅读 · 0 评论 -
栈的括号匹配
//括号匹配#include <iostream>#define MaxSize 50using namespace std;typedef struct{ char data[MaxSize]; int top;//栈顶指针}SqStack;//初始化栈void InitStack(SqStack &S){ S.top=-1;}int bracketCheck(SqStack &S,char str[],int length){原创 2021-08-11 08:04:12 · 89 阅读 · 0 评论