链表逆序

#include<iostream>
using namespace std;

struct node{
int value;
node* next;
};
//非递归
node* func(node* head)
{
if(head==NULL || head->next==NULL)
return head;

node* p1 = head;
node* p2 = p1->next;
node* p3 = p2->next;

while(p3)
{
p2->next = p1;
p1 = p2;
p2 = p3;
p3 = p3->next;
}
p2->next = p1;
head->next = NULL;

return p2;
}
//递归
node* head_new;
void func1(node* p)
{
if(p->next->next == NULL)
{
head_new = p->next;
}
else
{
func1(p->next);
}
p->next->next = p;
p->next = NULL;
}

int main()
{

node* head = new node;
node* pre = head;
pre->value = 1;

node* p;
for(int i=2; i<=10; i++)
{
p = new node;
p->value = i;
pre->next = p;
pre = p;
}
p->next = NULL;

//head = func(head);
//node* h = head;
func1(head);
head = head_new;
node* h;
for(h=head; h; h=h->next)
cout<<h->value<<" ";
cout<<endl;

return 0;
}