我试图写一个递归链表的反向函数,我的头在旋转。 有人可以告诉我如何修补功能?我怎样才能得到这个递归链表逆向工作?
node* recursiveReverse(node* h, node* prev)
{
node* current = h; //Point to current node
node* successor = h->next; //Points to next node
if(successor == NULL)
return prev;
successor->next = recursiveReverse(successor,current);
h->next = NULL;
return successor;
}
[Linked List recursive reverse]的可能重复(http://stackoverflow.com/questions/2434411/linked-list-recursive-reverse) – dasblinkenlight