创建:
LinkedList createLinkedList(int si) {
LinkedList head = NULL;
LinkedList tail = NULL;
for (int i = 0; i < si; i++) {
int value;
scanf("%d", &value);
ListNode* newNode =(ListNode*)malloc(sizeof(ListNode));
newNode->data = value;
newNode->next = NULL;
if (!head) {
head = newNode;
tail = newNode;
} else {
tail->next = newNode;
tail = newNode;
}
}
return head;
}
查找:
int zhao(LinkedList head,int x){
int t=0;
while(head!=NULL)
{ t++;
if(head->data==x)
{
return t;
}
else
head=head->next;
}
return 0;
}
插入:
LinkedList insert1(LinkedList head,int i,int x)
{
LinkedList p,q;
if(i<=0)
{
ListNode* p=(ListNode*)malloc(sizeof(ListNode));
p->data=x;
p->next=head->next;
head->next=p;
return head;
}
p=head->next;
q=head;
int k=1;
while(p!=NULL)
{
if(i==k)
{
ListNode* p =(ListNode*)malloc(sizeof(ListNode));
p->data=x;
p->next=q->next;
q->next=p;
return head;
}
k++;
q=q->next;
p=p->next;
}
p= (ListNode*)malloc(sizeof(ListNode));
p->data=x;
q->next=p;
p->next=NULL;
return head;
}求个数:
int fan(LinkedList head,int x){
int count=0;
while(head!=NULL)
{
if(head->data==x)
{
count++;
}
head=head->next;
}
return count;
}