有双向循环链表结点定义为： struct node {

#include <iostream>
#include <map>
using namespace std;

struct Node
{
    int data;
    Node *front, *next;
};

void DeleteCommonNode(Node *&pHeadA, Node*pHeadB)
{
    if(pHeadA == NULL || pHeadB == NULL)
        return ;
        
    map<int,Node *> hmap;
    Node *tmp = pHeadA; 
    while(tmp)
    {
        hmap[tmp->data] = tmp;
        tmp = tmp->next;
    }
    Node *tmpb = pHeadB;
    while(tmpb)
    {
        if(hmap[tmpb->data] != NULL)
        {
            //存在相同data，从A和B中删除
            if(tmpb == pHeadB)
            {
                pHeadB = pHeadB->next;
                pHeadB->front = NULL; 
            }
            else
            {
                tmpb->front->next = tmpb->next;
                tmpb->next->front = tmpb->front;
            } 
            delete tmpb;
            
            Node *tmpa = hmap[tmpb->data];
            hmap.erase(tmpa->data);
            if(tmpa == pHeadA)
            {
                pHeadA = pHeadA->next;
                pHeadA->front = NULL; 
            }
            else
            {
                tmpa->front->next = tmpa->next;
                tmpa->next->front = tmpa->front;
            }
            delete tmpa;
            
             
        }
    }
    
    
}
int main(void)
{
    return 0;
}

因为双向直接从头和尾进行比较