线性表的插入出问题

来源：百度知道 编辑：UC知道 时间：2024/05/26 18:23:22
#include<iostream>
#define MAXSIZE 100
using namespace std;

typedef int ElemType;

typedef struct SeqList
{
ElemType data[MAXSIZE];
int length;
}SeqList;

SeqList SeqListInit();
void SeqListInsert(SeqList L,int i,ElemType x);
void SeqListDelete(SeqList L,int i);
int SeqListLocate(SeqList L,ElemType x);

int main()
{
SeqList L;
int p,i;
ElemType q,x;

cout<<"构造线性表中...."<<endl;
SeqListInit();
cout<<"构造完成"<<endl<<endl;

cout<<"插入位置i和元素x"<<endl;
cin>>i>>x;
p=i;
q=x;
cout<<p<<" "<<q<<endl;
SeqListInsert(L,p,q);
cout<<endl;

cout<<"删除操作"<<endl;
cin>>i;
SeqListDelete(L,p);
cout<<endl;

cout<<"按值查找"

下面是我找到的几处错误.

#include<iostream>
#define MAXSIZE 100
using namespace std;

typedef int ElemType;

typedef struct SeqList
{
ElemType data[MAXSIZE];
int length;
/*这里的length到底是指当前链表的长度还是指它的最大长度，如果是当前长度，那为什么在SeqListInit()中有这句： L.length=MAXSIZE; 如果是最大长度，在SeqListInsert(SeqList L,int i,ElemType x)中为什么又有这句： L.length++; */
}SeqList;

SeqList SeqListInit();
void SeqListInsert(SeqList L,int i,ElemType x);
void SeqListDelete(SeqList L,int i);
int SeqListLocate(SeqList L,ElemType x);

int main()
{
SeqList L;
int p,i;
ElemType q,x;

cout<<"构造线性表中...."<<endl;
SeqListInit();
cout<<"构造完成"<<endl<<endl;

cout<<"插入位置i和元素x"<<endl;
cin>>i>>x;
p=i;
q=x;
cout<<p<<" "<<q<<endl;
Se