日本综合一区二区|亚洲中文天堂综合|日韩欧美自拍一区|男女精品天堂一区|欧美自拍第6页亚洲成人精品一区|亚洲黄色天堂一区二区成人|超碰91偷拍第一页|日韩av夜夜嗨中文字幕|久久蜜综合视频官网|精美人妻一区二区三区

//double LinkList implement with C++ template 
#include 
using namespace std; 
/*template 
class DBListADT 
{ 
   public: 
       virtual void Append(const Type &)=0; 
       virtual void Insert(const Type &)=0; 
       virtual void Remove(const Type &)=0; 
}; 
template 
class DLinkListNode:public DBListADT//此處必須為實(shí)現(xiàn)的類(lèi)型，當(dāng)然以派生類(lèi)的模板類(lèi)型也可以，但是不能是Type 
{ 
   public: 
       void Append(const T &);//這邊也需要是當(dāng)前類(lèi)的類(lèi)型,不能為T(mén)ype 
       void Insert(const T &); 
       void Remove(const T &); 
 
 
};*/ 
templateclass DLinkList; 
template 
class DNode 
{ 
       friend class DLinkList;//指定前需聲明 
   public: 
       DNode(){next=NULL;prior=NULL;} 
       ~DNode(){} 
   private: 
       DNode *next; 
     DNode *prior; 
       Type data; 
}; 
template 
class DLinkList 
{ 
  public: 
       DLinkList() 
       { 
       //   head=new DNode[sizeof(DNode)]; 
          head=new DNode; 
       } 
       ~DLinkList() 
       { 
          if(head->next==NULL) 
              delete head; 
          else 
          { 
              DNode *p=head->next; 
              DNode*s=NULL; 
              while(p) 
              { 
                 s=p->next ; 
                 delete p; 
                 p=s; 
              } 
          } 
       } 
       void DeleteElement(size_t position) 
       { 
          DNode *p=head->next; 
          size_t index=1; 
          for(;indexnext ; 
          if(p==NULL) 
              return ; 
          p->prior ->next =p->next ; 
          p->next ->prior =p->prior ; 
          delete p; 
       } 
       void InsertElement(T data,size_t position); 
       void CreateDLinkList(T a[],int n); 
       void PrintDLinkList(); 
   private: 
       DNode *head; 
  
}; 
template void DLinkList:: InsertElement (T data,size_t position) 
{ 
 DNode *p=head->next; 
 size_t index=1; 
 for(;indexnext; 
 if(p==NULL) 
     return; 
 //DNode *s=new DNode[sizeof(DNode)]; 
 DNode *s=new DNode; 
 s->data=data; 
 s->next=p; 
 s->prior=p->prior; 
 p->prior->next=s; 
 p->prior=s; 
} 
template void DLinkList::CreateDLinkList(T a[],int n) 
{ 
 DNode*p=head; 
 DNode*s=NULL; 
 int i=0; 
 for(;i[sizeof(DNode)]; 
     s=new DNode; 
       s->data=a[i]; 
       p->next=s; 
       s->prior=p; 
       p=s; 
 } 
 s->next=NULL; 
} 
templatevoid DLinkList::PrintDLinkList () 
{ 
   DNode *p=head->next; 
   while(p) 
   { 
       cout<data<next; 
   } 
} 
int main() 
{ 
  int a[10]={1,2,3,4,5,6,7,8,9,10}; 
   DLinkListDlist; 
   Dlist.CreateDLinkList(a,10); 
   Dlist.DeleteElement (3); 
   Dlist.InsertElement(3,3); 
   Dlist.PrintDLinkList(); 
   return 0; 
} 
//double LinkList implement with C++ Class 
//************************************************************ 
/*#include 
using namespace std; 
class Node 
{ 
   friend class List; 
public: 
  //Node(int a):next(NULL),prior(NULL),data(a){} 
   Node(){} 
private: 
  Node *next; 
   Node *prior; 
   int data; 
}; 
class List 
{ 
public: 
   List() 
   { 
       cout<<"create head DBLinkList"<next==NULL) 
     { 
        delete head; 
     } 
     else 
     { 
        Node *p=head->next; 
        Node *s; 
        delete head; 
        while(p) 
        { 
            s=p->next ; 
            delete p; 
            p=s; 
        } 
     } 
     cout<<"destructor called to clear DBLinkList"<next =NULL; 
   Node *s,*p=head; 
   int i=0; 
   for(;idata =a[i]; 
       p->next =s; 
       s->prior =p; 
       p=s; 
   } 
   s->next =NULL; 
} 
void List::PrintDList() 
{ 
   Node *p=head->next ; 
   while(p) 
   { 
       cout<data <next ; 
   } 
} 
void List::DeleteElemData(int position) 
{//可以通過(guò)重載delete運(yùn)算符來(lái)達(dá)到這個(gè)效果，則直接用delete就OK了 
  Node *p=head->next ; 
   //while(p!=NULL&&p->data !=data) 
   //   p=p->next ; 
   int i=1; 
   for(;inext ; 
   if(p==NULL) 
       return ; 
   p->prior ->next =p->next ; 
   p->next ->prior =p->prior ; 
   delete p; 
} 
void List::InsertElement (int data,int position) 
{//可以重載new運(yùn)算符來(lái)達(dá)到這個(gè)效果，則直接用new就OK了 
  Node *p=head->next ; 
   int i=1; 
   for(;inext ; 
   Node *s=new Node[sizeof(Node)]; 
   s->data =data; 
   s->prior =p->prior ; 
   s->next =p; 
   p->prior ->next =s; 
   p->prior =s; 
} 
int main() 
{ 
   List Dlist; 
   int a[10]={1,2,3,4,5,6,7,8,9,10}; 
   Dlist.CreateDoubleLink (a,10); 
   Dlist.DeleteElemData(3); 
   Dlist.InsertElement (3,3); 
   Dlist.PrintDList (); 
   return 0; 
}*/ 
//*************************************************************************************