反转链表

法一：迭代法

法二：递归法

#include<iostream>
using namespace std;
struct node
{
node* next;
int number;
};
node* reverseList1(node* head)//思路是改变链表的指针方向，由向后变为向前
{
if (head == NULL || head->next == NULL)
{
return head;
}
node* NewHead=NULL;
while (head != NULL)
{
node* temp = head->next;//用一个temp记住之后的node
head->next = NewHead;//改变指针方向
NewHead = head;//扩展新的链表，NewHead为新链表表头
head = temp;//使head指向旧链表表头
}
return NewHead;
}
node* NewHead;
node* reverseList2(node* head)
{
node* p = head;
if (p == NULL || p->next == NULL)
{
return p;
}
else
{
NewHead = reverseList2(p->next);//递归调用
p->next->next = p;//指针方向变换，从后往前
p->next = NULL;//原链表最后node指向null
return NewHead;//NewHead一直指向原链表最后一个node
}
}
void print(node* head)
{
if (head == NULL)return;
while (head!=NULL)
{
cout << head->number << " ";
head = head->next;
}
cout << endl;
return;
}
int main()
{
node* head;
node* tail;


node node0;
node node1;
node node2;


node0.number = 0;
node1.number = 1;
node2.number = 2;


node0.next = &node1;
node1.next = &node2;
node2.next = NULL;


head = &node0;
tail = &node2;


print(head);
print(reverseList1(head));
print(reverseList2(head));
system("pause");
return 0;
}