数据结构与算法顺序表的插入，删除以及查找的代码

最新推荐文章于 2023-10-27 00:56:38 发布

妖灵_yl

最新推荐文章于 2023-10-27 00:56:38 发布

阅读量568

点赞数 2

文章标签：数据结构

本文链接：https://blog.csdn.net/m0_69269828/article/details/124024804

版权

#include<iostream>
#include<cassert>
typedef int elemtype;
using namespace std;
struct SeqList {
   int *elem;
   int size;
   int length;
};
void SeqListInit(SeqList& L, int initsize)
{
   L.elem = new int[initsize];
   L.size = initsize;
   L.length = 0;
}
void SeqListInsert(SeqList& L, int i, int e) {
   for (int j = L.length - 1; j >= i - 1; j--)
       L.elem[j + 1] = L.elem[j];
   L.elem[i - 1] = e;
   L.length++;

}
void SeqListDelete(SeqList& L, int i)
{

   for (int j = i; j <= L.length - 1; j++)
       L.elem[j - 1] = L.elem[j];
   L.length--;
}
int SeqListLocate(SeqList& L, int e)
{
   for (int i = 0; i < L.length;i++)
   if (L.elem[i] == e)
       return i + 1;
   return -1;
}

//顺序表的打印
void SeqListPrint(SeqList& L) {
   for (int i = 0; i < L.length; i++) {
       cout << L.elem[i] << " ";
   }
   cout << endl;
}

void main() {
   SeqList L;
   SeqListInit(L, 10);
   SeqListInsert(L, 1, 1);
   SeqListInsert(L, 1, 2);
   SeqListInsert(L, 1, 3);
   SeqListInsert(L, 1, 4);
   SeqListInsert(L, 1, 5);
   cout << "插入试验:" << "";
   SeqListPrint(L);
   SeqListDelete(L, 1);
   SeqListDelete(L, 2);
   cout << "删除实验:" << "";
   SeqListPrint(L);
   cout << "查找元素1的位置:" <<
SeqListLocate(L, 4)<<endl;
   getchar();
}