#include c++.h>
using namespace std;
struct node {
int data;
node* next;
};
node* creat(int* a) {
node *p,*pre,*head;
head=new node;
head->next=NULL;
pre=head;
for(int i=0; i<10; i++) {
p=new node;
p->data=a[i];
p->next=NULL;
pre->next=p;
pre=p;
}
return head;
}
int search(node* head,int x) {
int count=0;
node* L=head->next;
while(L!=NULL) {
if(L->data==x) {
count++;
}
L=L->next;
}
return count;
}
void Insert(node* head,int pos,int x) {
node* p=head;
for(int i=0; i<pos-1; i++) {
p=p->next;
}
node* q=new node;
q->data=x;
q->next=p->next;
p->next=q;
}
void del(node* head,int pos) {
node* pre=head;
node* p=head->next;
for(int i=0; i<pos-1; i++) {
pre=p;
p=p->next;
}
pre->next=p->next;
delete(p);
p=pre->next;
}
void del2(node* head,int x) {
node* p=head->next;
node* pre=head;
while(p!=NULL) {
if(p->data==x) {
pre->next=p->next;
delete(p);
p=pre->next;
} else {
pre=p;
p=p->next;
}
}
}
int main() {
int a[10]= {1,2,3,4,5,2,2};
node* L=creat(a);
int x=2;
Insert(L,7,100);
//del2(L,5);
del(L,2);
int answer=search(L,x);
L=L->next;
while(L!=NULL) {
cout<<L->data<<" ";
L=L->next;
}
cout<<endl;
cout<<answer<<endl;
return 0;
}
08-28
08-28