单链表反转
摘要:
void reverse(List* list){ Node* before = list->first; if (before != NULL) { Node* after = before->next; before->next = NULL; while (after) { //交换指针 Node* temp = after->next; after->next = before; before = after; after = temp; } }} 阅读全文
posted @ 2011-05-09 21:43 NULL00 阅读(454) 评论(0) 推荐(0) 编辑