Files
data-structures-and-algorithms/homework2/test1.cpp
T
2024-10-19 00:04:17 +08:00

24 lines
522 B
C++

#include <iostream>
#include "LinkList.h"
using namespace std;
void insert(bookList &l) {
bookNode *temp = l;
while (temp != NULL) {
cin >> (*temp).id >> (*temp).name >> (*temp).price;
if (!(((*temp).id == "0" && (*temp).name == "0" && (*temp).price == 0))) {
temp = (*temp).next = new bookNode;
} else {
temp = NULL;
}
}
}
int main() {
bookList books = new bookNode;
books->next = NULL;
insert(books);
display(&books);
return 0;
}