LinkList

本文总结了一些单链表的基本操作。

CreateHeadLinkList, CreateNoHeadLinkList, PrintHeadLinkList, PrintNoHeadLinkList
ReverseList, GetNodeDataByNum, GetNodePointerByNum,
DeleteNodeByNum, InsertNodeAfterPointer, BubbleSort.

/* LinkList 2010-4-22 wcdj CreateHeadLinkList CreateNoHeadLinkList PrintHeadLinkList PrintNoHeadLinkList ReverseList GetNodeDataByNum GetNodePointerByNum DeleteNodeByNum InsertNodeAfterPointer BubbleSort */ #include <iostream> using namespace std; #define NULL 0 typedef char datatype; typedef struct Node { datatype data; struct Node *next; }LNode, *LinkList; // create a LinkList head node // insert the new node from the last node LinkList CreateHeadLinkList() { LinkList head=(LinkList)malloc(sizeof(LNode)); if (!head) { cerr<<"error: malloc head node! "<<endl; return NULL; } head->data=NULL; head->next=NULL; cout<<"create the head node"<<endl; cout<<"enter the data of node (# to end): "<<endl; LinkList node=NULL; LinkList cur=head; char ch; while (cin>>ch) { if (ch=='#') { break; } // create a new node node=(LinkList)malloc(sizeof(LNode)); if (!node) { cerr<<"error: malloc new node! "<<endl; return NULL; } node->data=ch; node->next=NULL; // insert the new node into the LinkList cur->next=node; cur=node; cout<<"insert a new node into the LinkList"<<endl; } cin.clear(); return head; } // create a LinkList without head node // insert the new node as the first node LinkList CreateNoHeadLinkList() { cout<<"enter the data of node (# to end): "<<endl; LinkList node=NULL; LinkList curhead=NULL;// the first node, that is the last node in the LinkList char ch; while (cin>>ch) { if (ch=='#') { break; } // create a new node node=(LinkList)malloc(sizeof(LNode)); if (!node) { cerr<<"error: malloc new node! "<<endl; return NULL; } node->data=ch; // insert the new node into the LinkList node->next=curhead; curhead=node;// mark the current head node cout<<"insert a new node into the front of LinkList"<<endl; } cin.clear(); return curhead; } // print the LinkList with head node void PrintHeadLinkList(LinkList head) { if (head==NULL || head->next==NULL) { cout<<"the LinkList is NULL"<<endl; return; } LinkList cur=head->next; while (cur) { cout<<cur->data<<" "; cur=cur->next; } cout<<endl; } // print the LinkList without head node void PrintNoHeadLinkList(LinkList curhead) { if (curhead==NULL) { cout<<"the LinkList is NULL"<<endl; return; } LinkList cur=curhead; while (cur) { cout<<cur->data<<" "; cur=cur->next; } cout<<endl; } // reverse the LinkList void ReverseList(LinkList &head) { if (head==NULL || head->next==NULL) { cout<<"the LinkList is NULL"<<endl; return; } LinkList pfirst=head,psecond=pfirst->next,pthird=psecond->next; pfirst->next=NULL; while (pthird) { psecond->next=pfirst; pfirst=psecond; psecond=pthird; pthird=pthird->next; } psecond->next=pfirst; head=psecond; } // delete the LinkList void DeleteLinkList(LinkList head) { LinkList tmp=NULL; while (head) { tmp=head; head=head->next; free(tmp); } cout<<"delete LinkList"<<endl; } // get the data from some node by number datatype GetNodeDataByNum(LinkList head, int num) { if (head==NULL) { cout<<"the LinkList is NULL"<<endl; return NULL; } int i=0; while (head) { ++i; if (i==num) { return head->data; } head=head->next; } cout<<"there is no this number"<<endl; return NULL; } // get the pointer of node by number LinkList GetNodePointerByNum(LinkList head,int num) { if (head==NULL) { cout<<"the LinkList is NULL"<<endl; return NULL; } int i=0; while (head) { ++i; if (i==num) { return head; } head=head->next; } //cout<<"there is no this number"<<endl; return NULL; } // delete the node by number LinkList DeleteNodeByNum(LinkList head,int n) { if (head==NULL) { cout<<"the LinkList is NULL"<<endl; return NULL; } LinkList p=GetNodePointerByNum(head,n); if (p==head)// only one node { return head; } LinkList front=GetNodePointerByNum(head,n-1); if (p->next==NULL)// the last node { front->next=NULL; return p; } else { front->next=p->next; return p; } } // insert the node void InsertNodeAfterPointer(LinkList &head,LinkList p,LinkList pDele) { if (p==NULL)// the only one head node before pDele node { pDele->next=head; head=pDele; } else { pDele->next=p->next; p->next=pDele; } } // bubble sort void BubbleSort(LinkList &head) { // calculate the length of the LinkList int len=0; LinkList tmp=head; while (head) { ++ len; head=head->next; } head=tmp; for (int i=len-1; i!=0; --i) { bool mark=false; for (int j=len; j!=len-i; --j) { if (GetNodeDataByNum(head,j-1)>GetNodeDataByNum(head,j)) { // swap=delete+insert LinkList pDele=DeleteNodeByNum(head,j);// three cases LinkList p=GetNodePointerByNum(head,j-2); InsertNodeAfterPointer(head,p,pDele); mark=true; } } if (!mark) { break; } } } int main() { LinkList head=CreateHeadLinkList(); PrintHeadLinkList(head); LinkList nohead=CreateNoHeadLinkList(); PrintNoHeadLinkList(nohead); // sort the data cout<<"after bubblesort, the data is: "<<endl; BubbleSort(head);// delete+insert PrintHeadLinkList(head); // sort the data cout<<"after bubblesort, the data is: "<<endl; BubbleSort(nohead);// delete+insert PrintNoHeadLinkList(nohead); // reverse the LinkList ReverseList(head); PrintNoHeadLinkList(head);// note after reversing, the LinkList has no head node ReverseList(nohead); PrintNoHeadLinkList(nohead); // when not using to delete the LinkList DeleteLinkList(head); DeleteLinkList(nohead); return 0; }