逆序链表

逆序链表

一个单向链表，逆序它。用一遍循环，需要多用几个指针多指一下即可。

逆序链表
typedef struct Node
{
	int    data;
	Node*  next;
	Node(int data, Node* pNext) {
		this->data = data;
		this->next = pNext;
	}
}TNODE;



Node*  reverseList(Node* pList) {

	Node* phead = pList;

	Node* node = pList;
	Node* pPrev = nullptr;
	Node* pNext = node->next;

	while (node->next !=nullptr) {
		node->next = pPrev;

		pPrev = node;  //三句话移步操作
		node = pNext;
		pNext = node->next;		
	}	
	node->next = pPrev;  //处理最后一个节点
	return node;
}


void PrintList(Node* pList) {
	Node* node = pList;
	while (node) {
		printf("node->data=%d , ", node->data);
		node = node->next;
	}
}


int  main()
{
	Node*  head = nullptr;
	Node*  pPrev = nullptr;
	for (int i = 0; i < 10; i++) {
	
		Node*  node = new Node(i, NULL);
		if (pPrev)
		{
			pPrev->next = node;
		}
		else {
			head = node;
		}
		pPrev = node;
	}

	PrintList(head);

	Node* reHead = reverseList(head);
	printf("afterReverse\n");
	PrintList(reHead);

	system("pause");
	return 0;
}