第二十四题（链表的逆序）

第24题：反转链表。

采用头插法，从链表的第二个节点开始，依次将节点插入到头结点head之后，即可完成逆序。

代码：

#include "stdafx.h"
#include<vector>
#include<stack>
#include<iostream>
#include<ctime>
#include <functional>	
#include<iostream>
using namespace std;
namespace MS100P_24
{
	struct node
	{
		int data;
		node* next;
	};
	node* createList(int len)                                                      //创建链表
	{
		node* head = new node();
		node* pCurrent = head;
		srand(time(0));
		for (int i = 0; i < len; i++)
		{
			pCurrent->next = new node();
			pCurrent = pCurrent->next;
			pCurrent->data = rand() % 100;
		}
		pCurrent->next = NULL;

		return head;
	}

	void deleteList(node * p)
	{
		node*q;
		while (p != NULL)
		{
			q = p;
			p = p->next;
			delete q;
		}
	}
	void printList(node * head)                                                                 //打印输出链表内容
	{
		node* p = head->next;
		while (NULL != p)
		{
			cout << p->data << ' ';
			p = p->next;
		}
		cout << endl;
	}
	void reverseList(node* head)
	{
		if (head == NULL || head->next == NULL)	return;	//无效的head节点或者空链表
		node* pPrevious = head->next;
		node* pCurrent=pPrevious->next;
		while (pCurrent != NULL)	//从链表中的第二个节点开始，依次将节点插入到头结点后面，完成逆序
		{
			pPrevious->next = pCurrent->next;
			pCurrent->next = head->next;			
			head->next = pCurrent;
			pCurrent = pPrevious->next;
		}
	}

	void test()
	{
		node* head = createList(10);
		printList(head);
		reverseList(head);
		printList(head);
	}
}

程序运行环境Microsoft Visual Studio Express 2013 for windows Desktop