查重部分有些改的地方。。。
#include<iostream>
#include<string>
#define MAXSIZE 1000
#define ElemType Book
#define Status bool
#define OK true
#define ERROR false
using namespace std;
//图书。信息为:书号、名称、价格
typedef struct
{
int number;
string name;
float price;
}Book;
//定义顺序表
typedef struct
{
ElemType *elem;
int length;
}SqList;
//初始化顺序表
Status InitList(SqList &L)
{
L.elem = new ElemType[MAXSIZE];
//if(!L.elem) exit(OVERFLOW);
L.length = 0;
return OK;
}
//查询最爱图书
void LocateElem(SqList &L,ElemType e)
{
int i;
for(i = 0;i < L.length;i++)
{
if(L.elem[i].number == e.number)
{
cout << "书号" << "\t书名\t" << "价格" << endl;
cout << L.elem[i].number << "\t" << L.elem[i].name << "\t" << L.elem[i].price << endl;
cout << endl;
break;
}
}
if(i == L.length)
{
cout << "该书号不存在,查询失败!" << endl;
cout << endl;
}
}
Status CompareElem(SqList &L,ElemType e)
{
for(int i = 0;i < L.length;i++){
if(L.elem[i].number == e.number)
return OK;