构造链表ABC，删除在A中的ABC的公共元素_C++实现

最新推荐文章于 2022-12-22 10:53:31 发布

iteye_2060

最新推荐文章于 2022-12-22 10:53:31 发布

阅读量192

点赞数

文章标签：数据结构与算法 c/c++

本文介绍了一个使用C++实现的数据结构程序，该程序通过构造三个链表并进行处理来演示链表的基本操作，如插入元素、遍历和删除等。通过对链表节点的管理，展示了链表作为一种常用数据结构的应用。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

"head.h"

#include<iostream> using namespace std; class NODE { public: NODE(); int num; NODE *next; }; NODE::NODE() { num=0; next=NULL; } class DATA { public: DATA(); void Constructor(); void Print(); void Process(); private: NODE *head1,*head2,*head3,*p,*pr,*keep; int first; }; DATA::DATA() { head1=head2=head3=p=pr=keep=NULL; first=1; } void DATA::Constructor() { if(first<=3) { cout<<"Constructor "<<first<<" called !"<<endl; } else return; cout<<"How Many Numbers Do You Want To Enter ?"<<endl<<endl; int nnum,input; cin>>nnum; if(nnum!=0) { p=new NODE; cin>>input; p->num=input; switch(first) { case 1: head1=p; break; case 2: head2=p; break; case 3: head3=p; break; } nnum--; } while(nnum--) { p->next=new NODE; p=p->next; cin>>input; p->num=input; } p->next=NULL; first++; } void DATA::Print() { cout<<"Print called !"<<endl<<endl; p=head1; if(p==NULL) cout<<"No Data !"<<endl; while(p!=NULL) { cout<<p->num<<endl; p=p->next; } cout<<endl; } void DATA::Process() { cout<<"Processor called !"<<endl<<endl; pr=p=head1; while(head2!=NULL&&head3!=NULL) { if(head2->num<p->num) { keep=head2; head2=head2->next; delete keep; } if(head3->num<p->num) { keep=head3; head3=head3->next; delete keep; } if(head2==NULL||head3==NULL) return; if(head2->num==p->num&&head3->num==p->num) { if(p==head1) { head1=head1->next; delete p; p=pr=head1; } else { pr->next=p->next; delete p; p=pr->next; } if(p==NULL) return; } if((head2->num>=p->num&&head3->num>p->num)||(head2->num>p->num&&head3->num>=p->num)) { pr=p; p=p->next; if(p==NULL) return; } } }

"main.cpp"

#include<iostream> #include"head.h" using namespace std; int main() { DATA data; data.Constructor(); data.Constructor(); data.Constructor(); data.Process(); data.Print(); system("pause"); }