摘要： 题目：将单链表逆置#include <iostream>typedef struct __node{ int value; __node* next;} NODE, *PNODE;PNODE reverse(PNODE head){ if (!head) { return head; } PNODE curNode = head; PNODE nextNode = head->next; head->next = NULL; while (nextNode) { PNODE afterNextNode = nextNode->next; nextNode-> 阅读全文