简易的校友录，运用了指针数组和类链表， void Add(node *&head, string na) { node *a, *p; a = new node; a->Name = na; if (head->next == NULL) { head->next = a; a->next = NULL; return; } p = head->next; while (p->next != NULL) { p = p->next; } p->next = a;