保存 - 数据结构

作者: 主教主

next

2022/05/18 22:30

处理LC的数据域

# include <stdio.h>
# include <stdlib.h>

int flag = 0;  
typedef struct{  
int data;  
int flag;  
struct Linklist *next;  
}Linklist;

//创建LC存储LA，LB的交并差(无序)  
Linklist* LinkAIO(Linklist *LA,Linklist *LB)  
{  
Linklist  _LC,_node;  
LC = (Linklist *)malloc(sizeof(Linklist));  
Linklist  _p = LA->next,_q = LB->next;  
//交集  
while(p != NULL)  
{  
while(q!=NULL)  
{  
if(p->data == q->data)  
{  
p->flag = 1;

  }
        else
        {
            q = q->next;
        }

    }
    q = LB->next;
    p = p->next;

}
//重新回到头节点，用于下次循环
p = LA->next;
q = LB->next
while(p->next!=NULL)
{

  //处理LC的数据域(*****)

          for(;p->next!=NULL;p = p->next)
      {

          if(p->data == 0)
          {
              node = (Linklist *)malloc(sizeof(Linklist));
              node->data = p->data;
              node->next = LC->next ;
            LC->next  = node;
          }
          else
          {
              continue;
          }

      }


}

}

int main()  
{
return 0;
}