在链表中删除相同节点.docVIP

在链表中删除相同节点 1需求分析： 依次比较两个链表元素，取出两个链表相同元素，组成一个新的链表并赋顺序指针 struct Node ?{ ?int number; ?Node *next; Node *p，*q； }; 2源代码 #include?stdafx.h?? #include?iostream?? //双向循环链表的操作?? using?namespace?std;?? typedef?struct?Dbnode{?? ?int?data;??????//节点数据?? ??Dbnode?*left;??//前驱结点指针?? ??Dbnode?*right;?//后继节点指针?? }Dbnode;?? void?Print(Dbnode?*head);?? ?? //根据数据创建节点?? Dbnode?*CreateNode(int?data){?? Dbnode?*pnode=new?Dbnode;//?? ????if?(pnode==NULL){?//如果内存申请失败，返回NULL?? ????????return?NULL;?? ????}?? ????pnode-data=data;?? ????pnode-left=pnode;//新节点的前驱和后继指针都指向自身?? ????pnode-right=pnode;?? ????return?pnode;?? }?? ?? //在表尾插入新节点，返回表头节点?? Dbnode?*AppendNode(Dbnode?*head,int?data){?? ????if?(head==NULL){?? ????????return?NULL;?? ????}?? ????Dbnode?*phead=head;?? ????Dbnode?*pnode=CreateNode(data);//创建一个新节点?? ????while?(head!=phead-right){?//找到表尾?? ???????????phead=phead-right;?? ????}?? ????pnode-right=phead-right;//右连接?? ????head-left=pnode;?? ????phead-right=pnode;//左连接?? ????pnode-left=phead;?? ????return?head;?? }?? ?? //双向循环链表测长?? int?GetLength(Dbnode?*head){?? ????if?(head==NULL)//如果指针为空则返回0?? ????{?? ????????return?0;?? ????}?? ????Dbnode?*phead=head-right;?? ????int?i=1;?? ????while?(head!=phead){?? ??????????phead=phead-right;?? ???????????i++;?? ????}?? ????return?i;?? }?? ?? ?? //双向循环链表的节点查找?? Dbnode?*FindNode(Dbnode?*head,int?data){?? ????if?(head==NULL){?? ????????return?NULL;?? ????}?? ????if?(head-data==data){?//如果表头节点和值相等?? ????????return?head;?? ????}?? ????Dbnode?*phead=head-right;?? ????while?(head?!=?phead??phead-data?!=?data){?? ???????????phead=phead-right;?? ??????}?? ????if?(phead-data==data){//如果是值相等退出，则返回节点?? ????????return?phead;?? ????}?? ????else??//如果没有找到，则返回NULL?? ????????return?NULL;?? }?? ?? ?? ?? //获得pA链表和pB链的交集，返回一个新链表?? Dbnode?*GetLink(Dbnode?*pA,Dbnode?*pB){?? ????if?(pA==NULL?||?pB==NULL){//如果为空，则返回NULL?? ????????return?NULL;?? ????}?? ????Dbnode?*pC=NULL;?? ??