反转链表

最新推荐文章于 2019-01-20 12:12:40 发布

真水壶

最新推荐文章于 2019-01-20 12:12:40 发布

阅读量476

点赞数

分类专栏：编程练习文章标签：链表

本文链接：https://blog.csdn.net/enjoyuseless/article/details/18899609

版权

编程练习专栏收录该内容

76 篇文章 1 订阅

订阅专栏

struct node
{
	int value;
	struct node* next;
};

struct node * reverseList(struct node *head)
{
	if(!head || !head->next) return head;
	struct node *pre=head,*cur=head->next;
	head->next=0;
	while(cur)
	{
		struct node *tmp=cur->next;
		cur->next=pre;
		pre=cur;
		cur=tmp;
	}
	return pre;
}

int main()
{
	// 2014/4/2
	struct node n1,n2,n3,n4,n5;
	n1.value=1,n2.value=2,n3.value=3,n4.value=4,n5.value=5;
	n1.next=&n2,n2.next=&n3,n3.next=&n4,n4.next=&n5,n5.next=0;
	reverseList(&n1);
	return 0;
}