信管117118李志荣数据结构实验一

最新推荐文章于 2018-05-27 10:31:11 发布

EMP颠覆者

最新推荐文章于 2018-05-27 10:31:11 发布

阅读量242

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/rumple49/article/details/79779913

本文展示了一个使用C++实现的简单链表操作程序，包括插入、删除和查找功能，并通过一个菜单驱动的界面来控制这些操作。文章通过具体代码示例介绍了如何在C++中管理和操作链表数据结构。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include<iostream>
using namespace std;
const int MAXSIZE=100;
struct SetList
{
double data;
int next;
}DATA[MAXSIZE];
class Function
{
public:
void Show()
{cout<<"the "<<i+1<<" data is:"<<DATA[i].data<<" "<<endl;}
void Insert();
void Delete();
void Check();
};
int main()
{
int i=0;
for (;i<100;i++)
{
DATA[i].next=i+1;
DATA[i].data=i;
cout<<"the "<<i+1<<" data is:"<<DATA[i].data<<" "<<endl;
}

int number=0;
while(number<=5)
{
cout<<"Menu(put the number to perform the relevant function):"<<endl<<"#1:SHOW ALL DATA"<<endl;
cout<<"#2:INSERT A DATA IN LIST"<<endl;
cout<<"#3:DELETE A DATA"<<endl;
cout<<"#4:CHECK A DATA"<<endl;
cout<<"#5(or bigger than 5):EXIT"<<endl;
cin>>number;
switch(number)
{
case 1:Function.Show();break;
case 2:Function.Insert();break;
case 3:Function.Delete();break;
case 4:Function.Check();break;
default:cout<<"Bye!";
}
}
return 0;
}

void Function::Insert()
{
cout<<"please give the insert order number";
int ins;
cin>>ins;
while(ins>=MAXSIZE||ins<0)
{
if(ins>=MAXSIZE) {cout<<"overflow,plese input a right number"; cin>>ins;}
if(ins<0) {cout<<"Illegal,plese input a right number";cin>>ins;}
}
cout<<"enter a data to the new:";
setlist *s;
s=new setlist;
cout<<"enter a data";
cin>>s->data;
state int maxs=MAXSIZE;
s->next=maxs;
DATA[ins].next=maxs;
maxs=maxs+1;
}