这是啥错误啊,为啥我的问答里就可以运行,我的就不能运行呢,能不能帮我改改啊。
#include <stdio.h>
#include <stdlib.h>
struct node
{//链表结点类型,包含一个存放整型数据的 data 成员,和一个指向下一个结点的next成员
int data;
struct node * next;
};
//第一关代码
struct node *createRlist()
{//函数功能:创建一个有一个空循环链表,返回值为头指针
struct node *head = (struct node *)malloc(sizeof(struct node));
head->next= head;
return head;
}
struct node * insertOrder(struct node* list,int insData)
{
//在单向递增有序的循环链表(表头指针list)中插入数据元素insData,使之依然有序 。返回值是头指针
struct node *p = (struct node *)malloc(sizeof(struct node));
p->data=insData;
if(list->next == list || list->next->data>insData)
{
p->next = list->next;
list->next = p;
}
else
{
struct node * q = list;
while(q->next!=list && q->next->data < insData)
q = q->next;
p->next = q->next;
q->next = p;
}
return list;
}
int deleteData(struct node *list, int delData)
{
//在单向递增有序循环链表(表头指针list)中删除所有值为delData的结点,返回值为删除结点的个数
struct node *p = list,*q;
while(p->next!=list && p->next->data < delData)
p = p->next;
if(p->next == list || p->next->data > delData)
return 0;
int count = 0;
q = p->next;
while(q!=list && q->data == delData)
{
q = q->next;
count++;
}
p->next = q;
return count;
}
void printRlist(struct node *list)
{
//从链表第一个结点开始输出单向循环链表中各数据元素的值,每输出一个数据元素空一格
struct node * q = list->next;
while(q!=list)
{
printf("%d ",q->data);
q = q->next;
}
}
int destroyRlist(struct node *list)
{
//从第一个结点开始释放循环链表各结点占用的空间,返回值为最后一个结点的值
struct node *p = list->next;
int k;
while(list->next!=list)
{
p = list->next;
list->next = p->next;
k = p->data;
free(p);
}
return k;
}
int main()
{
struct node *list = createRlist();
int n;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
int a;
scanf("%d",&a);
list = insertOrder(list,a);
}
printRlist(list);
printf("\n");
//
int b;
scanf("%d",&b);
printf("%d\n",deleteData(list,b));
printf("%d\n",destroyRlist(list));
return 0;
}