Status InsertByIndex(BookList booklist, int i, Book &book)
{
LNode* p = booklist->front;
LNode*node=new LNode;
int j = 0;
if (i == 1)
{
node->next =booklist->front;
booklist->front = node;
}
else
{
while (p->next && j<i - 2)
{
p = p->next; j++;
}
if (!(p->next) || j>i - 2) return ERROR;
node->next = p->next;
p->next = node;
}
return OK;
}
Book yw;
yw.isbn = "2"; yw.name = "yuwen"; yw.price = 20;
InsertByIndex(booklist, 1, yw);
cout << "插入后" << endl;
PrintBookList(booklist);