A->B->C
A<-B<-C
void reverse() {
Node* current = head;
Node *prev = NULL, *next = NULL;
while (current != NULL) {
next = current->next;
current->next = prev;
prev = current;
current = next;
}
head = prev;
}
单向链表的倒置
于 2016-03-17 19:53:48 首次发布