关淳 2022-10-08 17:41 采纳率: 73.9%
浏览 14
已结题

删除A链表中B链表与C链表的交集元素 A,B,C都是递增链表

我测试应该是IntersectionDelete函数有问题
咋改可以啊🥹

#include <bits/stdc++.h>
using namespace std;

typedef int LLDataType;

typedef struct LinkList {
LLDataType data;
struct LinkList* next;
}Link;

void CreateLinkList (Link* &head, int n)
{
head = (Link*)malloc(sizeof(Link));
head->next = NULL;
Link* tail = head;
while (n--)
{
Link* a = (Link*)malloc(sizeof(Link));
a->next = NULL;
scanf("%d", &a->data);
tail->next = a;
tail = a;
}
return;
}

void IntersectionDelete (Link* &L, Link* L2, Link* L3)
{
L2 = L2->next;
L3 = L3->next;
while (L2 && L3)
{
if (L2->data == L3->data)
{
Link* L1 = L;
while (L1)
{
if (L1->next->data == L2->data)
{
Link* del = L1->next;
L1->next = L1->next->next;
free (del);
}
else
L1 = L1->next;
}
L2 = L2->next;
L3 = L3->next;
}
if (L2->data < L3->data)
L2 = L2->next;
if (L3->data < L2->data)
L3 = L3->next;
}
return;
}

void LinkListPrint (Link* L)
{
Link* L1 = L->next;
while (L1)
{
printf ("%d ", L1->data);
L1 = L1->next;
}
puts ("");
}

int main ()
{
Link *La, *Lb, *Lc;
int na, nb, nc;

cout << "请输入表A的长度\n";
cin >> na;
cout << "请输入表A\n";
CreateLinkList (La, na);

cout << "请输入表B的长度\n";
cin >> nb;
cout << "请输入表B\n";
CreateLinkList (Lb, nb);

cout << "请输入表C的长度\n";
cin >> nc;
cout << "请输入表C\n";
CreateLinkList (Lc, nc);

IntersectionDelete (La, Lb, Lc);
cout << "删除Lb和Lc交集元素的La为\n";
LinkListPrint (La);

return 0;
}

  • 写回答

1条回答 默认 最新

  • CSDN-Ada助手 CSDN-AI 官方账号 2022-10-08 18:11
    关注
    评论

报告相同问题?

问题事件

  • 已结题 (查看结题原因) 10月9日
  • 创建了问题 10月8日