摘要： 1 #include <iostream> 2 using namespace std; 3 4 #include <stdio.h> 5 6 struct Node { 7 int data; 8 Node * next; 9 };10 // 非递归11 Node * Reverse(Node * first)12 {13 Node *p = first, *q, *r;14 if (p == NULL)15 return p;16 r = p->next;17 p->next = NULL;18 while (r... 阅读全文