数据结构--每天一题-顺序表查询
顺序表查询
顺序表查询,可以运行的!!!!!!
//本文按值查询
(默认1,2,60)
想改就for{scanf()}就行了
tips:后缀必须cpp
顺序表删除
https://blog.csdn.net/weixin_46493164/article/details/124307679
顺序表插入在上面点开删除的链接文章里有链接(我也没办法,外链只能加一个)
// An highlighted block
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>
#define MaxSize 50
typedef int ElemType;
//静态分配
typedef struct {
ElemType data[MaxSize];
int length;//当前顺序表多少个元素
}SqList;
void PrintList(SqList& L)
{
for (int i = 0; i < L.length; i++) {
printf("%3d", L.data[i]);
}
printf("\n");
}
int LocateElem(SqList L, ElemType e)
{
int i;
for (i = 0; i < L.length; i++)
{
if (L.data[i] == e)
return i + 1;
}
return 0;
}
int main()
{
SqList L;
int searet;
L.data[0] = 1;
L.data[1] = 2;
L.data[2] = 60;
L.length = 3;
int sea;
scanf("%d", &sea);
searet = LocateElem(L, sea);//查找元素的值
//L,位置,值。
if (searet)
{
printf("查找成功\n");
printf("查找位置为%d\n", searet);
}
else {
printf("查找失败");
}
return 0;
}