反转链表（递归与非递归）

#include<iostream>
using namespace std;

typedef struct LNode{
int data;
LNode* next;
}LNode;
//非递归方法，
LNode* reverse(LNode* head)
{
if(!head||!head->next)
return head;
LNode *pre,*cur,*next;
pre = head;
cur = head->next;
next = cur->next;
pre->next = NULL;
while(next!=NULL)
{
next = cur->next;
cur->next = pre;
pre = cur;
cur = next;
}
head = pre;
return head;
}
//递归反转链表
LNode* reverseRecursion(LNode* currnode)
{
if(!currnode->next||!currnode)
{
return currnode;

}
else{

LNode* temp = reverseRecursion(currnode->next);
LNode* nextnode = currnode->next;
nextnode->next = currnode;
currnode->next = NULL;
return temp;//返回当前节点
}

}
//创建链表
LNode* createList(int n)
{
LNode* head, *temp,*pre;
head = NULL;
head = new LNode;
head->data = n;
pre = head;
while(n--)
{
temp = new LNode;
temp->data = n;
pre->next = temp;
pre = temp;
}
pre->next = NULL;
return head;

}

int main(){
int n =6;
LNode * list1,*list2,*temp1,*temp2;
list1 = createList(n);//初始链表
temp1 = list1;
while(n--)
{
cout<<"init node data:"<<temp1->data<<endl;
temp1 = temp1->next;
}
cout<<"head node data:"<<list1->data<<endl;
//list2 = reverse(list1);
list2 = reverseRecursion(list1);
n = 6;
temp2 = list2;
while(n--)
{
cout<<"reverse node data:"<<temp2->data<<endl;
temp2 = temp2->next;
}
return 0;
}