ldanduo的专栏

//删除链表中数据位item的数据 //copyright @anduo //date:2012.10.10 void PurgeItem(LinkList &list) { LinkList p, q =list; p = list->next; //judge the second node while (p != NULL) { if (p->data == item)

typedef struct node LinkNode; struct node { int data; LinkNode* next; }; // 返回新链表头节点 LinkNode *reverse_link(LinkNode *head) { if(head == NULL) return NULL; LinkNode *prev , *curr , *r