反转链表 C++实现

以下两个实现方法分别使用了递归和非递归形式

//============================================================================
// Name        : ReverseLinkedList.cpp
// Author      : Lee
// Version     :
// Copyright   : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================

#include <iostream>
using namespace std;
struct ListNode
{
	int m_nKey;
	ListNode* m_pNext;
};
ListNode * reverseList(ListNode * list){
	if(NULL==list||NULL==list->m_pNext)
		return list;
	ListNode * p=list;
	ListNode * q=p->m_pNext;
	ListNode * r=q->m_pNext;
	list->m_pNext=NULL;
	while(NULL!=r){
		q->m_pNext=p;
		p=q;
		q=r;
		r=r->m_pNext;
	}
	q->m_pNext=p;
	return q;
}
void reverseListByRecursion(ListNode * list,ListNode * p, ListNode * q,ListNode * &res){
	p->m_pNext=list;
	if(NULL==q){
		res=p;
		return;
	}else{
		reverseListByRecursion(p,q,q->m_pNext,res);
	}
}
int main() {
	cout << "!!!Hello World!!!" << endl; // prints !!!Hello World!!!
	ListNode * list=new ListNode();
	list->m_nKey=0;
	list->m_pNext=NULL;
	ListNode * link=list;
	for(int i=1;i<9;i++){
		ListNode * p=new ListNode();
		p->m_nKey=i;
		p->m_pNext=NULL;
		link->m_pNext=p;
		link=p;
	}
	link=list;
	while(link!=NULL){
		cout<<link->m_nKey<<endl;
		link=link->m_pNext;
	}
	list=reverseList(list);
	link=list;
	while(link!=NULL){
		cout<<link->m_nKey<<endl;
		link=link->m_pNext;
	}
	reverseListByRecursion(NULL,list,list->m_pNext,link);
	while(link!=NULL){
		cout<<link->m_nKey<<endl;
		link=link->m_pNext;
	}
	return 0;
}