C/C++反转单链表

思路：设三个结点n1,n2,n3,先让n1指向NULL，n2指向链表的第一个结点，n3指向n2->next,然后令n2->next等于n1，n1等于n2，n2等于n3,循环直到最后一个结点

参考代码：

struct mylist
{
    int d;
    mylist* next;
};
void reverselist(mylist *&h)
{
	mylist *n1,*n2,*n3;
	n2 = h;
	n1 = NULL;
	do
	{
		n3 = n2->next;
		n2->next = n1;
		n1 = n2;
		n2 = n3;
	}while(n3!=NULL);
	h = n1;
}