单链表的逆置使用递归算法出现？
node* reverse(node *head){if(head == NULL || head->next == NULL){return head;}node *cur = head;node *pre = NULL;node *tmp;while(cur->next){tmp = pre;pre = cur;cur = cur->next;pre->next = tmp; //操作pre的next逆转}cur->next = pre; //结束时，操作cur的next逆转return cur;}
