顺序表
#include<iostream>
#include<fstream>
#include<string>
#include<iomanip>
using namespace std;
#define OK 1
#define ERROR 0
#define OVERFLOW -2
typedef int Status;
typedef int ElemType;
#define MAXSIZE 100
struct Book {
string id;
string name;
double price;
};
typedef struct {
Book* elem;
int length;
} SqList;
Status InitList_Sq(SqList& L) {
L.elem = new Book[MAXSIZE];
if (!L.elem)
exit(OVERFLOW);
L.length = 0;
return OK;
}
Status GetElem(SqList L, int i, Book& e) {
if (i < 1 || i > L.length)
return ERROR;
e = L.elem[i - 1];
return OK;
}
int LocateElem_Sq(SqList L, double e) {
for (int i = 0; i < L.length; i++)
if (L.elem[i].price == e)
return i + 1;
return 0;
}
Status ListInsert_Sq(SqList& L, int i, Book e) {
if ((i < 1) || (i > L.length + 1))
return ERROR;
if (L.length == MAXSIZE)
return ERROR;
for (int j = L.length - 1; j >= i - 1; j--)
L.elem[j + 1] = L.elem[j];
L.elem[i - 1] = e;
++L.length;
return OK;
}
Status ListDelete_Sq(SqList& L, int i) {
if ((i < 1) || (i > L.length))
return ERROR;
for (int j = i; j <= L.length; j++)
L.elem[j - 1] = L.elem[j];
--L.length;
return OK;
}
int main() {
SqList L;
int i = 0, temp, a, c, choose;
double price;
Book e;
string head_1, head_2, head_3;
cout << " 1. 建立\n";
cout << " 2. 输入\n";
cout << " 3. 取值\n";
cout << " 4. 查找\n";
cout << " 5. 插入\n";
cout << " 6. 删除\n";
cout << " 7. 输出\n";
cout << " 0. 退出\n\n";
choose = -1;
while (choose != 0) {
cout << " 请选择:";
cin >> choose;
switch (choose) {
case 1:
if (InitList_Sq(L))
cout << " 成功建立顺序表\n\n";
else
cout << " 顺序表建立失败\n\n";
break;
case 2: {
i = 0;
L.elem = new Book[MAXSIZE];
if (!L.elem)
exit(OVERFLOW);
L.length = 0;
fstream file;
file.open("book.txt");
if (!file) {
cout << " 错误!未找到文件!" << endl;
exit(ERROR);
}
file >> head_1 >> head_2 >> head_3;
while (!file.eof()) {
file >> L.elem[i].id >> L.elem[i].name >> L.elem[i].price;
i++;
}
cout << " 输入 book.txt 信息完毕\n\n";
L.length = i;
file.close();
}
break;
case 3:
cout << " 请输入一个位置用来取值:\n";
cin >> i;
temp = GetElem(L, i, e);
if (temp != 0) {
cout << " 查找成功\n";
cout << " 第" << i << " 本图书的信息是:\n";
cout << left << setw(15) << e.id << "\t" << left << setw(50)
<< e.name << "\t" << left << setw(5) << e.price << endl
<< endl;
}
else
cout << " 查找失败!位置超出范围\n\n";
break;
case 4:
cout << " 请输入所要查找价格:";
cin >> price;
temp = LocateElem_Sq(L, price);
if (temp != 0) {
cout << " 查找成功\n";
cout << " 该价格对应的书名为:" << L.elem[temp - 1].name << endl << endl;
}
else
cout << " 查找失败!没有这个价格对应的书籍\n\n";
break;
case 5:
cout << " 请输入插入的位置和书本信息,包括:编号 书名 价格(用空格隔开):";
cin >> a;
cin >> e.id >> e.name >> e.price;
if (ListInsert_Sq(L, a, e))
cout << " 插入成功.\n\n";
else
cout << " 插入失败.\n\n";
break;
case 6:
cout << " 请输入所要删除的书籍的位置:";
cin >> c;
if (ListDelete_Sq(L, c))
cout << " 删除成功.\n\n";
else
cout << " 删除失败.\n\n";
break;
case 7:
cout << " 当前图书系统信息(顺序表)读出:\n";
for (i = 0; i < L.length; i++)
cout << left << setw(15) << L.elem[i].id << "\t" << left
<< setw(50) << L.elem[i].name << "\t" << left
<< setw(5) << L.elem[i].price << endl;
cout << endl;
break;
}
}
return 0;
}
链式表
#include <iostream>
#include <string>
#include <iomanip>
#include <fstream>
using namespace std;
#define OK 1
#define ERROR 0
#define OVERFLOW -2
typedef int Status;
typedef int ElemType;
struct Book {
string id;
string name;
double price;
};
typedef struct LNode {
Book data;
struct LNode* next;
} LNode, * LinkList;
string head_1, head_2, head_3;
int length;
Status InitList_L(LinkList& L) {
L = new LNode;
L->next = NULL;
return OK;
}
Status GetElem_L(LinkList L, int i, Book& e) {
int j;
LinkList p;
p = L->next;
j = 1;
while (j < i && p) {
p = p->next;
++j;
}
if (!p || j > i)
return ERROR;
e = p->data;
return OK;
}
LNode* LocateElem_L(LinkList L, double e) {
LinkList p;
p = L->next;
while (p && p->data.price != e)
p = p->next;
return p;
}
Status ListInsert_L(LinkList& L, int i, Book& e) {
int j;
LinkList p, s;
p = L;
j = 0;
while (p && j < i - 1) {
p = p->next;
++j;
}
if (!p || j > i - 1)
return ERROR;
s = new LNode;
s->data = e;
s->next = p->next;
p->next = s;
++length;
return OK;
}
Status ListDelete_L(LinkList& L, int i) {
LinkList p, q;
int j;
p = L;
j = 0;
while ((p->next) && (j < i - 1)) {
p = p->next;
++j;
}
if (!(p->next) || (j > i - 1))
return ERROR;
q = p->next;
p->next = q->next;
delete q;
--length;
return OK;
}
void CreateList_H(LinkList& L, int n) {
LinkList p;
L = new LNode;
L->next = NULL;
length = 0;
fstream file;
file.open("book.txt");
if (!file) {
cout << "未找到相关文件,无法打开!" << endl;
exit(ERROR);
}
file >> head_1 >> head_2 >> head_3;
while (!file.eof()) {
p = new LNode;
file >> p->data.id >> p->data.name >> p->data.price;
p->next = L->next;
L->next = p;
length++;
}
file.close();
}
void CreateList_R(LinkList& L, int n) {
LinkList p, r;
L = new LNode;
L->next = NULL;
r = L;
length = 0;
fstream file;
file.open("book.txt");
if (!file) {
cout << "未找到相关文件,无法打开!" << endl;
exit(ERROR);
}
file >> head_1 >> head_2 >> head_3;
while (!file.eof()) {
p = new LNode;
file >> p->data.id >> p->data.name >> p->data.price;
p->next = NULL;
r->next = p;
r = p;
length++;
}
file.close();
}
int main() {
int a, n, choose;
double price;
Book e;
LinkList L, p;
cout << "1. 建立\n";
cout << "2. 输入\n";
cout << "3. 取值\n";
cout << "4. 查找\n";
cout << "5. 插入\n";
cout << "6. 删除\n";
cout << "7. 输出\n";
cout << "0. 退出\n\n";
choose = -1;
while (choose != 0) {
cout << "请选择:";
cin >> choose;
switch (choose) {
case 1:
if (InitList_L(L))
cout << "成功建立链表!\n\n";
break;
case 2:
CreateList_R(L, length);
cout << "输入 book.txt 信息完毕\n\n";
break;
case 3:
cout << "请输入一个位置用来取值:";
cin >> a;
if (GetElem_L(L, a, e)) {
cout << "查找成功\n";
cout << "第" << a << "本图书的信息是:\n";
cout << left << setw(15) << e.id << "\t" << left << setw(50)
<< e.name << "\t" << left << setw(5) << e.price << endl
<< endl;
}
else
cout << "查找失败\n\n";
break;
case 4:
cout << "请输入所要查找价格:";
cin >> price;
if (LocateElem_L(L, price) != NULL) {
cout << "查找成功\n";
cout << "该价格对应的书名为:" << LocateElem_L(L, price)->data.name
<< endl << endl;
}
else
cout << "查找失败! 定价" << price << " 没有找到\n\n";
break;
case 5:
cout << "请输入插入的位置和书的信息,包括:编号 书名 价格(用空格隔开):";
cin >> a;
cin >> e.id >> e.name >> e.price;
if (ListInsert_L(L, a, e))
cout << "插入成功.\n\n";
else
cout << "插入失败!\n\n";
break;
case 6:
cout << "请输入所要删除的书籍的位置:";
cin >> a;
if (ListDelete_L(L, a))
cout << "删除成功!\n\n";
else
cout << "删除失败!\n\n";
break;
case 7:
cout << "当前图书系统信息(链表)读出:\n";
p = L->next;
while (p) {
cout << left << setw(15) << p->data.id << "\t" << left << setw(
50) << p->data.name << "\t" << left << setw(5)
<< p->data.price << endl;
p = p->next;
}
cout << endl;
break;
}
}
system("pause");
return 0;
}