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

struct node

{ int data

struct node *front,*next

}

有两个双向循环链表A，B，知道其头指针为：pHeadA,pHeadB，请写一函数将两链表中data值相同的结点删除，并测试。-Two-way linked list node cycle defined as: struct node (int data　struct node* front,* next )　there are two two-way circulation list A, B, know as the first indicator: pHeadA, pHeadB, please write a function of the two data values in the same list of nodes removed, and test.