后期链表の《笔记22》
2025-12-20 11:50:41
发布于：广东
4阅读
0回复
0点赞
增加大合集
#include<bits/stdc++.h>
using namespace std;
struct N{
int date;
N* next;
};
N* f(N* head,int x){
N* p=head;
while(p!=NULL){
if(p->date==x){
return p;
}
p=p->next;
}return NULL;
}
void iii(N* head,int v){
N* NN=new N;
NN->date=v;
NN->next=NULL;
N* p=head;
while(p->next!=NULL){
p=p->next;
}
p->next=NN;
}
void iiii(N* h,int v){
if(h==NULL){
return;
}
N* NN=new N;
NN->date=v;
NN->next=h->next;
h->next=NN;
}
void pp(N* head){
N* p=head;
while(p!=NULL){
cout<<p->date;
cout<<" -> ";
p=p->next;
}
cout<<"Null"<<endl;
}
N* ii(N* head,int v){
N* NN=new N;
NN->date=v;
NN->next=head;
return NN;
}
int main(){
int n;
cin>>n;
N* head =new N;
head->date=0;
head->next=NULL;
N* p=head;
for(int i=1;i<=n;i++){
N* q=new N;
cin>>q->date;
q->next=NULL;
p->next=q;
p=q;
}
pp(head);
head=ii(head,-1);
pp(head);
iii(head,n+1);
pp(head);
N* h=f(head,2);
iiii(h,114514);
pp(head);
}
这里空空如也
有帮助，赞一个