数据结构实验一——线性表

#ifndef SeqList_H
#define SeqList_H
const int MaxSize=10;
class SeqList
{
public:
SeqList(){length=0;}
SeqList(int a[],int n);
~SeqList(){}
void Insert(int i,int x);
int Delete(int i);
int Locate(int x);
void PrintList();
int Get(int i);
private:
int data[MaxSize];
int length;
};

#endif

#include <iostream.h>
#include "SeqList.h"
void main()
{
int r[5]={1,2,3,4,5};
SeqList L(r,5);
cout<<"执行插入操作前数据为："<<endl;
L.PrintList();
try
{L.Insert(4,7);}
catch(char *s)
{cout<<s<<endl;}
cout<<"执行插入操作后数据为："<<endl;
L.PrintList();
cout<<"值为3的元素位置为：";
cout<<L.Locate(3)<<endl;
cout<<"查找位置为3的数据：";
cout<<L.Get(3)<<endl;
cout<<"执行删除第一个元素操作，删除前数据为："<<endl;
L.PrintList();
try
{L.Delete(1);}
catch(char *s)
{cout<<s<<endl;}
cout<<"删除后数据为："<<endl;
L.PrintList();

}

#include<iostream.h>
#include"SeqList.h"


SeqList::SeqList(int a[],int n)
{
int i;
if(n>MaxSize)throw"参数非法";
for(i=0;i<n;i++)
data[i]=a[i];
length=n;
}


void SeqList::Insert(int i,int x)
{
int j;
if(length>=MaxSize)throw"上溢";
if(i<1||i>length+1)throw"位置非法";
for(j=length;j>=i;j--)
data[j]=data[j-1];
data[i-1]=x;
length++;
}


int SeqList::Delete(int i)
{
if(length==0)throw"下溢";
if(i<1||i>length)throw"位置非法";
int x=data[i-1];
for(int j=i;j<length;j++)
data[j-1]=data[j];
length--;
return x;
}


int SeqList::Get(int i)
{
if(i<1||i>length)throw"查找位置非法";
else return data[i-1];
}
int SeqList::Locate(int x)
{
int i;
for(i=0;i<length;i++)
if(data[i]==x)return i+1;
return 0;
}


void SeqList::PrintList()
{
int i;
for(i=0;i<length;i++)
cout<<data[i]<<endl;
}