删除相同值节点

来源：互联网发布：org.apache jar包下载编辑：程序博客网时间：2024/06/05 00:45

双向循环链表结点定义为：
struct node
{ int data;
struct node *front,*next;
};

两个双向循环链表A，B，头指针为：pHeadA,pHeadB，函数将两链表中data值相同的结点删除：

BOOL DeteleNode(Node *pHead, DataType Value)
{
if (pHeader == NULL) return false;

BOOL bRet = FALSE;
Node *pNode = pHead;
while (pNode != NULL)
{
      if (pNode->data == Value)
      {
         if (pNode->front == NULL)
         {
                  pHeader = pNode->next;
                  pHeader->front = NULL;
         }
         else
         {
                  if (pNode->next != NULL)
                  {
                        pNode->next->front = pNode->front;
                  }
                  pNode->front->next = pNode->next;
         }

      Node *pNextNode = pNode->next;
      delete pNode;
      pNode = pNextNode;

      bRet = TRUE;
               }
      else
      {
         pNode = pNode->next;
      }
}

return bRet;
}

删除相同值：

void DE(Node *pHeadA, Node *pHeadB)
{
if (pHeadA == NULL || pHeadB == NULL)
{
      return;
}

Node *pNode = pHeadA;
while (pNode != NULL)
{
      if (DeteleNode(pHeadB, pNode->data))
      {
         if (pNode->front == NULL)
         {
                  pHeadA = pNode->next;
                  pHeadA->front = NULL;
         }
      else
      {
         pNode->front->next = pNode->next;
         if (pNode->next != NULL)
         {
            pNode->next->front = pNode->front;
         }
      }
      Node *pNextNode = pNode->next;
      delete pNode;
      pNode = pNextNode;
      }
      else
      {
         pNode = pNode->next;
      }
}
}