单链表反转

这里采用遍历法进行链表的反转，过程简单，前节点和当前节点改变指向即可，具体见代码：

#include<iostream>
using namespace std;
typedef struct node
{
    int data;
	struct node *next;
}list;
list *creat(int n)//单链表的创建
{
     list *p,*head,*q;
	 p=new list;
	 int i=1;
	 p->data=i;
	 i++;
	 head=p;
	 while(i<=n)
	 {
	      q=new list;
		  q->data=i;//新数据，p指向新数据
		  p->next=q;
		  i++;
		  p=q;
	 }
	 p->next=NULL;
	 return head;
	// delete [] p;
	// delete [] q;
	free(p);
	free(q);
}
void display(list *head)//从头节点逐个打印
{
    list *p;
	p=head;
	while(p!=NULL)
	{
		cout<<p->data<<" ";
		p=p->next;
	}
	cout<<endl;
}
list *list_converse(list *head)//链表翻转，遍历法
{
     list *pre,*cur,*pnext;
	 pre=head;
	 cur=head->next;
	 head->next=NULL;//头结点变尾节点，指向null
	 while(cur)
	 {
		 pnext=cur->next;//保留当前节点的下一节点
		 cur->next=pre;//当前节点指向前节点
		 pre=cur;
		 cur=pnext;
	 }
	 head=pre;
	 return head;
}
int main()
{
    list *head=NULL;
	int n;
	cout<<"请输入N:";
	cin>>n;
	head=creat(n);
	display(head);
    cout<<"链表翻转结果为："<<endl;
	head=list_converse(head);
	display(head);

}

<img src="https://img-blog.csdn.net/20140828100140669?watermark/2/text/aHR0cDovL2Jsb2cuY3Nkbi5uZXQvemZ5MjAwODcyMjA0MDM=/font/5a6L5L2T/fontsize/400/fill/I0JBQkFCMA==/dissolve/70/gravity/Center" alt="" />