看圖深入理解單鏈表的反轉(zhuǎn)

ActList* ReverseList2(ActList* head)
{
	//ActList* temp=new ActList;
 if(NULL==head|| NULL==head->next) return head; //少于兩個(gè)節(jié)點(diǎn)沒(méi)有反轉(zhuǎn)的必要。
 ActList* p;
	ActList* q;
	ActList* r;
 p = head; 
 q = head->next;
 head->next = NULL; //舊的頭指針是新的尾指針，next需要指向NULL
 while(q){
 r = q->next; //先保留下一個(gè)step要處理的指針
 q->next = p; //然后p q交替工作進(jìn)行反向
 p = q; 
 q = r; 
 }
	head=p; // 最后q必然指向NULL，所以返回了p作為新的頭指針
 return head; 
}

struct ListNode{
 int val;
 ListNode* next;
 ListNode(int a):val(a),next(NULL){}
};
ListNode* reverseLinkedList3(ListNode* head){
  if(head==NULL||head->next==NULL)
   return head;
  ListNode* p=head; //指向head
  ListNode* r=head->next; //指向待搬運(yùn)的節(jié)點(diǎn)，即依次指向從第2個(gè)節(jié)點(diǎn)到最后一個(gè)節(jié)點(diǎn)的所有節(jié)點(diǎn)
  ListNode* m=NULL; //充當(dāng)搬運(yùn)工作用的節(jié)點(diǎn)
  ListNode* tail=head->next;
  while(r!=NULL){ //bug2 循環(huán)語(yǔ)句寫(xiě)錯(cuò)了, while寫(xiě)成了if
   m=r;
   r=r->next;
   m->next=p->next;
   p->next=m;
   //if(r!=NULL)
    //std::cout<<"m="<<m->val<<" ,p="<<p->val<<" ,r="<<r->val<<std::endl;
   //else
    //std::cout<<"m="<<m->val<<" ,p="<<p->val<<" ,r=NULL"<<std::endl;
  }
  head=p->next;
  tail->next=p;
  p->next=NULL;
  tail=p;
  return head; // bug1 忘記了return
 }

ActList* ReverseList3(ActList* head)
{
 ActList* p;
 ActList* q;
 p=head->next;
 while(p->next!=NULL){
 q=p->next;
 p->next=q->next;
 q->next=head->next;
 head->next=q;
 }

 p->next=head;//相當(dāng)于成環(huán)
 head=p->next->next;//新head變?yōu)樵環(huán)ead的next
 p->next->next=NULL;//斷掉環(huán)
 return head; 
}

//創(chuàng)建:用q指向當(dāng)前鏈表的最后一個(gè)節(jié)點(diǎn)；用p指向即將插入的新節(jié)點(diǎn)。
//反向:用p和q反轉(zhuǎn)工作，r記錄鏈表中剩下的還未反轉(zhuǎn)的部分。

#include "stdafx.h"
#include <iostream>
using namespace std;

struct ActList
{
	char ActName[20];
	char Director[20];
	int Mtime;
	ActList *next;
};

ActList* head;

ActList* Create()
{//start of CREATE()
	ActList* p=NULL;
	ActList* q=NULL;
	head=NULL;
	int Time;
	cout<<"Please input the length of the movie."<<endl;
	cin>>Time;
	while(Time!=0){
	p=new ActList;
	//類(lèi)似表達(dá): TreeNode* node = new TreeNode;//Noice that [new] should be written out.
	p->Mtime=Time;
	cout<<"Please input the name of the movie."<<endl;
	cin>>p->ActName;
	cout<<"Please input the Director of the movie."<<endl;
	cin>>p->Director;

	if(head==NULL)
	{
	head=p;
	}
	else
	{
	q->next=p;
	}
	q=p;
	cout<<"Please input the length of the movie."<<endl;
	cin>>Time;
	}
	if(head!=NULL)
	q->next=NULL;
	return head;

}//end of CREATE()


void DisplayList(ActList* head)
{//start of display
	cout<<"show the list of programs."<<endl;
	while(head!=NULL)
	{
		cout<<head->Mtime<<"\t"<<head->ActName<<"\t"<<head->Director<<"\t"<<endl;
		head=head->next;
	}
}//end of display


ActList* ReverseList2(ActList* head)
{
	//ActList* temp=new ActList;
 if(NULL==head|| NULL==head->next) return head; 
 ActList* p;
	ActList* q;
	ActList* r;
 p = head; 
 q = head->next;
 head->next = NULL;
 while(q){
  r = q->next; //
  q->next = p; 
  p = q; //
  q = r; //
 }
	head=p;
 return head; 
}

ActList* ReverseList3(ActList* head)
{
	ActList* p;
	ActList* q;
	p=head->next;
	while(p->next!=NULL){
		q=p->next;
		p->next=q->next;
		q->next=head->next;
		head->next=q;
	}

	p->next=head;//相當(dāng)于成環(huán)
	head=p->next->next;//新head變?yōu)樵環(huán)ead的next
	p->next->next=NULL;//斷掉環(huán)
	return head; 
}
int main(int argc, char* argv[])
{
//	DisplayList(Create());
// DisplayList(ReverseList2(Create()));
	DisplayList(ReverseList3(Create()));
	return 0;
}

// 遞歸版的第一種實(shí)現(xiàn)，借助類(lèi)的成員變量m_phead來(lái)表示新鏈表的頭指針。
struct ListNode{
 int val;
 ListNode* next;
 ListNode(int a):val(a),next(NULL){}
};

class Solution{
  ListNode* reverseLinkedList4(ListNode* head){ //輸入: 舊鏈表的頭指針
  if(head==NULL)
   return NULL;
  if(head->next==NULL){
   m_phead=head;
   return head;
  }
  ListNode* new_tail=reverseLinkedList4(head->next);
  new_tail->next=head;
  head->next=NULL;
  return head; //輸出: 新鏈表的尾指針
  }
 ListNode* m_phead=NULL;//member variable defined for reverseLinkedList4(ListNode* head)
};

struct ListNode{
 int val;
 ListNode* next;
 ListNode(int a):val(a),next(NULL){}
};

class Solution{
 ListNode* reverseLinkedList5(ListNode* head, ListNode* & new_head){ //輸入?yún)?shù)head為舊鏈表的頭指針。new_head為新鏈表的頭指針。
  if(head==NULL)
   return NULL;
  if(head->next==NULL){
   new_head=head; //當(dāng)處理到了舊鏈表的尾指針，也就是新鏈表的頭指針時(shí)，對(duì)new_head進(jìn)行賦值。因?yàn)槭且眯蛥?shù)，所以在接下來(lái)調(diào)用中new_head的值逐層傳遞下去。
   return head;
  }
  ListNode* new_tail=reverseLinkedList5(head->next,new_head);
  new_tail->next=head;
  head->next=NULL;
  return head; //輸出參數(shù)head為新鏈表的尾指針。
 }
};