C++数据结构实验2.1 链表结构

C++数据结构实验2.1 链表结构实现超级简陋的图书馆增加删除查找功能。（发现自己的代码真的好菜@_@）

/**2018数据结构实验2.1 链表**/
#include<iostream>
#include<string>
#include<cstring>
using namespace std;

//书本结构
struct Book
{
	string name;
	string author;
	string price;
	Book *next;
};

class Library
{
public:
	Library() { head = NULL; length = 0; };
	bool ifEmpty();
	void Add(string n, string a, string p);
	void Remove(string n, string a);
	int Find(string n);
private:
	Book * head;
	int length;
};

//是否为空
bool Library::ifEmpty()
{
	if (head == NULL)
		return false;
	else
		return true;
}

//增加书本
void Library::Add(string n, string a, string p)
{
        //如果是空的话初始化链表
	if (!ifEmpty())
	{
		Book *temp = new Book;
		temp->name = n;
		temp->author = a;
		temp->price = p;
		Book *t = new Book;
		t->next = NULL;
		temp->next = t;
		head = temp;
		length++;
		cout << "SUCCESS" <&