初见顺序表之后,做点作业
题目
顺序表实验
1、显示
2、插入
3、查找(显示比较次数)
4、删除(显示移动次数)
5、编程实现一个顺序表的就地逆置,即利用原表的存储空间将顺序表逆置。
提高题:
6、删除顺序表中元素值在x到y(x和y自定)之间的所有元素。
[解题思路] 在顺序表中设置两个初值为0的下标变量i和j,其中,i为比较元素的下标,j为赋值元素的下标。依次取顺序表中下标为i的元素与x和y比较,假若是x到y之外的元素,则赋值给下标为j的元素。这种算法比删除一个元素后立即移动其后面的元素的效率高得多。
7、编程实现将两个有序的顺序表进行合并,要求同样的数据元素只出现一次。
[解题思路] 由于两个顺序表中的元素呈有序排列,在进行合并的时候,依次比较,哪个顺序表的元素值小,就先将这个元素复制到新的顺序表中,若两个元素相等,则复制一个即可,这样一直到其中的一个顺序表结束,然后将剩余的顺序表复制到新的顺序表中即可。
直接代码
#include <iostream>
#include <iomanip>
#include <conio.h>
#include <stdio.h>
#include <process.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
#include <set>
#define max 10000
using namespace std;
struct SqList
{
int elem[max]; //存放元素的数组
int length; //当前长度
};
void init(SqList &list);
void display(SqList &list);
void insert(SqList &list);
void search(SqList &list);
void del(SqList &list);
void qjdel(SqList &list);
void nzlist(SqList &list);
void hblist(SqList &a,SqList &b);
void hblist_qianzhi(SqList &list);
typedef int DataType;
SqList list,a,b;//定义
int main()
{
char choice;
while (1)
{
system("cls");
cout << "\n\n\n\n";
cout << "\t\t 静态线性表操作 \n";
cout << "\t\t====================================== 19软工a1陈包玮";
cout << "\n\n";
cout << "\t\t 1:初始化 \n";
cout << "\t\t 2:显示 \n";
cout << "\t\t 3:插入 \n";
cout << "\t\t 4:查找 \n";
cout << "\t\t 5:删除 \n";
cout << "\t\t 6:区间删除 \n";
cout << "\t\t 7:就地逆置 \n";
cout << "\t\t 8:合并 \n";
cout << "\n";
cout << "\t\t 0:退出 \n";
cout << "\n";
cout << "\t\t请选择:" << flush;
choice = getch();
system("cls");
switch(choice){
case '1':
init(list);
break;
case '2':
display(list);
break;
case '3':
insert(list);
break;
case '4':
search(list);
break;
case '5':
del(list);
break;
case '6':
qjdel(list);
break;
case '7':
nzlist(list);
break;
case '8':
hblist(a,b);
break;
case '0':
exit(0);
}
}
}
void init(SqList &list){
int i;
cout<<endl;
while (1){
cout<<"输入元素个数(0-" <<max<< "):"<<flush;//flush强制送出缓存区内容
cin>>list.length;
if (list.length>=0&&list.length<=max)
break;
cout<<endl;
}
while (1){
cout<<"输入随机数种子(0-32767):"<<flush;
cin>>i;
if (i>=0&&i<=32767)
break;
cout<<endl;
}
srand(i);//指定随机数种子,相同的种子将产生相同的数据序列
for (i = 0; i < list.length; i++){
list.elem[i] = rand() % 10000;//生成1-10000随机数
if(i%10==0) cout<<endl;
cout<<setw(6)<<list.elem[i];
}
cout<<endl;
cout<<endl;
system("pause");
for (i=list.length;i<max;i++)//剩余空间设为0?
list.elem[i]=0;
}
void display(SqList &list){
int i;
cout<<endl;
cout<<" 顺序表list中的元素个数:"<<list.length<<endl;
for (i=0;i<list.length;i++){
if(i%10==0) cout<<endl;
cout<<setw(6)<<list.elem[i];
}
cout<<endl;
cout<<endl;
system("pause");
}
void insert(SqList &list){
cout<<endl;
if(list.length==(max-1)){
cout<<" 顺序表已满"<<endl;
}
else{
cout<<" 输入将插入顺序表末尾的元素值:";
cin>>list.elem[list.length];
list.length++;
cout<<endl;
cout<<" 插入成功!"<<endl;
cout<<endl;
}
system("pause");
}
void search(SqList &list){
int aim,i;
cout<<endl;
cout<<" 输入想要查找的元素值:";
cin>>aim;
for(i=0;i<list.length;i++){
if(list.elem[i]==aim)
break;
}
cout<<endl;
i++;
if(i==(list.length+1)){
cout<<" 顺序表中没有该元素 "<<endl;
cout<<" 比较次数: "<<i<<" 次"<<endl;
}
else{
cout<<" 元素值 "<<aim<<" 是顺序表中的第 "<<i<<" 个元素"<<endl;
cout<<" 比较次数: "<<i<<" 次"<<endl;
}
cout<<endl;
system("pause");
}
void del(SqList &list){
int aim,i,j,cnt=0;
cout<<endl;
cout<<" 输入想要删除的元素值:";
cin>>aim;
cout<<endl;
for(i=0;i<list.length;i++){
if(list.elem[i]==aim)
break;
}
i++;
if(i==(list.length+1)){
cout<<" 删除失败,顺序表中没有该元素"<<endl;
cout<<" 比较次数: "<<i<<" 次"<<endl;
}
else{
for(j=i;j<list.length;j++){
list.elem[j]=list.elem[j+1];
cnt++;
}
list.length--;
cout<<" 删除成功!"<<endl;
cout<<" 比较次数: "<<i<<" 次"<<endl;
cout<<" 移动次数: "<<cnt<<" 次"<<endl;
}
cout<<endl;
system("pause");
}
void qjdel(SqList &list){
int x,y,i,j=0;
cout<<endl;
cout<<" 输入要删除的区间x与y(1—"<<list.length<<"): ";
cin>>x>>y;
cout<<endl;
for(i=0;i<list.length;i++){
if(i<x||i>y){
list.elem[j]=list.elem[i];
j++;
}
}
list.length-=(y-x+1);
for(i=list.length;i<max;i++){
list.elem[i] = 0;
}
cout<<" 区间x到y已删除!"<<endl;
cout<<endl;
system("pause");
}
void nzlist(SqList &list){
int i,j;
for(i=0;i<((list.length-1)/2);i++){
j=(list.length-1)-i;
list.elem[i]=list.elem[i]^list.elem[j];
list.elem[j]=list.elem[i]^list.elem[j];
list.elem[i]=list.elem[i]^list.elem[j];
}
cout<<endl;
cout<<" 顺序表已逆置!"<<endl;
cout<<endl;
system("pause");
}
void hblist(SqList &a,SqList &b){
int i,cnt=0;
cout<<endl;
cout<<" 初始化表a:"<<endl;
hblist_qianzhi(a);
cout<<endl;
cout<<" 初始化表b:"<<endl;
hblist_qianzhi(b);
cout<<endl;
cout<<" ————合并ing......———— "<<endl;
cout<<endl;
set<int>A;
for(i=0;i<=a.length;i++){
A.insert(a.elem[i]);
}
for(i=0;i<=b.length;i++){
A.insert(b.elem[i]);
}
for(set<int>::iterator it=A.begin();it!=A.end();it++){
cout<<setw(6)<<*it;
cnt++;
if(cnt==10){
cout<<endl;
cnt=0;
}
}
A.clear();
cout<<endl;
system("pause");
}
void hblist_qianzhi(SqList &list){
int i,j,min,tmp;
cout<<endl;
while (1){
cout<<"输入元素个数(0-"<<max<<"):"<<flush;
cin>>list.length;
if(list.length>=0&&list.length<=max)
break;
cout<<endl;
}
while (1){
cout <<"输入随机数种子(0-32767): "<<flush;
cin>>i;
if(i>=0&&i<=32767)
break;
cout<<endl;
}
srand(i);
for (i=0;i<list.length;i++){
list.elem[i] = rand() % 10000;
}
for(i=0;i<list.length-1;i++){
min=i;
for(j=i+1;j<list.length;j++){
if(list.elem[j]<list.elem[min])
min=j;
}
tmp=list.elem[i];
list.elem[i]=list.elem[min];
list.elem[min]=tmp;
}
for (i=0;i<list.length;i++){
if(i%10==0) cout<<endl;
cout<<setw(6)<<list.elem[i];
}
cout<<endl;
cout<<endl;
system("pause");
for (i=list.length;i<max;i++)
list.elem[i] = 0;
}