单链表的删除

 struct Node{int Data;struct Node* next;};/** * @brief 该函数实现了删除带头结点单链表中第i个结点 * @param[in] head 待删除结点链表 * @param[in] i 待删除结点位置* @param[out] e 删除结点内容* @notice 带头结点的单链表中第一个元素为头结点后的元素，所以不存在删除头结点的情况* @author [e-mail] * http://blog.csdn.net/rabbit729 * @version 1.0 * @date 2009-03-08 */ int ListDelete(Node* head, int i, int& e){assert(head);if (head->next == NULL){return -1;}Node* p = head;int j = 0;// 寻找待删除结点的前驱结点，并用p指向待删除结点的前驱结点while ((p->next != NULL) && (j < i - 1)){p = p->next;j++;}Node* q = p->next; // 待删除结点// 处理删除最后一个结点的情况if (q->next == NULL){e = q->Data;p->next = NULL;delete q;q = NULL;return 0;}else{e = q->Data;p->next = q->next;delete q;q = NULL;return 0;}}/** * @brief 该函数实现了删除带头结点单链表中与给定值相等的第一个结点 * @param[in] head 待删除结点链表 * @param[in] data 待删除结点元素值* @author [e-mail] * http://blog.csdn.net/rabbit729 * @version 1.0 * @date 2009-03-08 */ int ListDelete(Node* head, int data){assert(head);if (head->next == NULL){return -1;}Node* prior = head;Node* q = head->next;// 寻找待删除结点的前驱结点，并用prior指向待删除结点的前驱结点while((q != NULL) && (q->Data != data)){prior = q;q = q->next;}// 删除元素if ((q != NULL) && (q->Data == data)){// 处理删除最后一个结点的情况if (q->next == NULL){prior->next = NULL;delete q;q = NULL;return 0;}else{prior->next = q->next;delete q;q = NULL;return 0;}}else{cout<<"Could not find data!"<<endl;return -1;}}