33,321
社区成员
发帖
与我相关
我的任务
分享单向循环链表，判断长度时出现中断错误
/*这个程序是循环链表*/
#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>
typedef int DataType;
typedef struct node{
DataType data;
struct node *next;
}CurrNode;
//链表初始化
void CurrInit(CurrNode **head)
{
if ((*head = (CurrNode*)malloc(sizeof(CurrNode))) == NULL)
{
exit(1);
}
(*head)->next = head;//构造循环链表
}
//链表长度返回
int Currlength(CurrNode *head)
{
CurrNode *per = head;
int num = 0;
while (per->next!=head)//出现中断错误？
{
num++;
per = per->next;
}
return num;
}
//链表插入
int CurrInsert(CurrNode *head, int i, DataType x)
{
CurrNode *per, *fin;
int j = -1;
if ((fin=(CurrNode*)malloc(sizeof(CurrNode)))==NULL)
{
exit(1);
}
per = head;
while(per->next!=head&&per->next->next!=head&&j<i-1)
{
per = per->next;
j++;
}
if (j!=i-1)
{
printf("插入位置错误！\n");
return 0;
}
fin->data = x;
fin->next = per->next;
per->next = fin;
return 1;
}
//链表删除
int CurrDelete(CurrNode *head, int i, DataType *x)
{
CurrNode *per, *tmp;
int j = -1;
if ((tmp = (CurrNode*)malloc(sizeof(CurrNode))) == NULL)
{
exit(1);
}
per = head;
while (per->next != head&&j<i - 1)//删除不需要判断下一个节点是否存在
{
per = per->next;
j++;
}
if (j != i - 1)
{
printf("删除位置错误！\n");
return 0;
}
*x = per->data;
tmp = per->next;
per->next = per->next->next;
free(tmp);
return 1;
}
//链表取出
int CurrGet(CurrNode *head, int i, DataType *x)
{
CurrNode *per=head;
int j = -1;
while (per->next!=head&&j != i)
{
j++;//失误
per = per->next;
}
if (j!=i)
{
printf("取出位置错误！\n");
return 0;
}
*x = per->data;
return 1;
}
//链表销毁
void CurrDestroy(CurrNode **head)
{
CurrNode *per = *head, *tmp;
if ((tmp = (CurrNode*)malloc(sizeof(CurrNode))) == NULL)
{
exit(1);
}
while (per->next != head)
{
tmp = per;
per = per->next;
free(tmp);
}
*head = NULL;
}
//主函数
int main()
{
CurrNode *mylist;
int i, x;
CurrInit(&mylist);
for ( i = 0; i < 100; i++)
{
if ((CurrInsert(mylist, i, i + 1)) == 0)
{
printf("插入位置错误！\n");
return ;
}
}
if ((CurrDelete(mylist, 5, &x)) == 0)
{
printf("删除位置错误！\n");
return;
}
else
{
printf("删除数字：%d\n", x);
}
for ( i = 0; i < Currlength(mylist); i++)
{
if ((CurrGet(mylist, i, &x)) == 0)
{
printf("取出位置错误！\n");
return;
}
else
{
printf("%d ",x);
}
}
CurrDestroy(&mylist);
getchar();
return 0;
}
整个代码如上，Currlength（）函数出现中断错误，请各位老师指教。
...全文
请发表友善的回复…
发表回复
蓝莓派Alex 2018-08-16
- 打赏
- 举报
谢谢你的答复。
赵4老师 2018-08-15
- 打赏
- 举报
仅供参考：
//不带表头结点的循环双向链表
#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>
#include <time.h>
#include <locale.h>
struct NODE {
int data;
struct NODE *next;
struct NODE *prev;
} *head,*p,*q,*s,*p1,*p2,*q1,**ta;
int i,k,n,t,m,v,N=10;
int main() {
setlocale(LC_ALL,"chs");
srand(time(NULL));
head=NULL;
printf("创建%d个节点的循环双向链表:",N);//创建N个节点的循环双向链表
p=head;
for (i=0;i<N;i++) {
q=(struct NODE *)malloc(sizeof(struct NODE));
if (NULL==q) exit(1);
q->data=rand()%100;//填写0..99的随机值
q->next=NULL;
q->prev=NULL;
if (NULL==p) {
head=q;
p=head;
} else {
p->next=q;
q->prev=p;
p=q;
}
}
p->next=head;
head->prev=p;
//输出整个循环双向链表
s=head;
while (1) {
if (NULL==s) {
printf("\n");
break;
}
printf("%02d(=)",s->data);
if (NULL!=s->next && s->next->prev!=s) {printf(" !\n");break;}
s=s->next;
if (s==head) {
printf(" Loop\n");
break;
}
}
k=3;
v=5;
printf("将值为%d的结点插入到循环双向链表的第%d个结点前:",v,k);//将值为v的结点插入到循环双向链表的第k个结点前
n=0;
p=head;
while (1) {
if (NULL==p) {
break;
}
n++;
if (k==1) {
q=(struct NODE *)malloc(sizeof(struct NODE));
if (NULL==q) exit(1);
q->data=v;
q->next=head;
q->prev=head->prev;
head->prev->next=q;
head->prev=q;
head=q;
break;
} else {
if (k-1==n) {
q=(struct NODE *)malloc(sizeof(struct NODE));
if (NULL==q) exit(1);
q->data=v;
q->next=p->next;
q->prev=p;
p->next->prev=q;
p->next=q;
break;
}
}
p=p->next;
if (p==head) break;
}
//输出整个循环双向链表
s=head;
while (1) {
if (NULL==s) {
printf("\n");
break;
}
printf("%02d(=)",s->data);
if (NULL!=s->next && s->next->prev!=s) {printf(" !\n");break;}
s=s->next;
if (s==head) {
printf(" Loop\n");
break;
}
}
k=5;
printf("删除第%d个节点:",k);//删除第k个节点
n=0;
p=head;
while (1) {
if (NULL==p) {
break;
}
n++;
if (k==1) {
q=head;
head=head->next;
head->prev=q->prev;
q->prev->next=head;
if (q==head) head=NULL;
free(q);
break;
} else {
if (k-1==n) {
q=p->next;
p->next=q->next;
q->next->prev=p;
free(q);
break;
}
}
p=p->next;
if (p==head) break;
}
//输出整个循环双向链表
s=head;
while (1) {
if (NULL==s) {
printf("\n");
break;
}
printf("%02d(=)",s->data);
if (NULL!=s->next && s->next->prev!=s) {printf(" !\n");break;}
s=s->next;
if (s==head) {
printf(" Loop\n");
break;
}
}
printf("从小到大排序:");//从小到大排序
for (p=head;p!=NULL;) {
p1=p->prev;
for (q=p->next,q1=p;q!=NULL;) {
if (p->data > q->data) {
//交换data
// printf("swap %02d %02d\n",p->data,q->data);
// t=p->data;p->data=q->data;q->data=t;
//或者
//交换prev和next
// printf("swap %02d %02d\n",p->data,q->data);
if (p==head) {//p是头
if (p->next==q) {//pq挨着
head=q;
head->prev=p1;
p1->next=q;
p->next=q->next;
p->prev=q;
q->next->prev=p;
q->next=p;
q=p;
p=head;
} else {//pq不挨着
head=q;
head->prev=p1;
p1->next=q;
p2=p->next;
p->next=q->next;
p->next->prev=p;
p->prev=q1;
q->next->prev=p;
q->next=p2;
p2->prev=q;
q1->next=p;
q=p;
p=head;
}
} else {//p不是头
if (p->next==q) {//pq挨着
p1->next=q;
p->next=q->next;
p->prev=q;
q->next->prev=p;
q->next=p;
q->prev=p1;
q=p;
p=p1->next;
} else {//pq不挨着
p1->next=q;
p2=p->next;
p->next=q->next;
p->prev=q->prev;
q->next->prev=p;
q->next=p2;
q->prev=p1;
p2->prev=q;
q1->next=p;
q=p;
p=p1->next;
}
}
//输出整个循环双向链表
// s=head;
// while (1) {
// if (NULL==s) {
// printf("\n");
// break;
// }
// printf("%02d(=)",s->data);
// if (NULL!=s->next && s->next->prev!=s) {printf(" !\n");break;}
// s=s->next;
// if (s==head) {
// printf(" Loop\n");
// break;
// }
// }
// printf("head,p,q:%02d %02d %02d\n",head->data,p->data,q->data);
// getchar();
}
q1=q;q=q->next;
if (q==head) break;
}
p=p->next;
if (p->next==head) break;
}
//输出整个循环双向链表并计算链表长度n
n=0;
s=head;
while (1) {
if (NULL==s) {
printf("\n");
break;
}
printf("%02d(=)",s->data);
if (NULL!=s->next && s->next->prev!=s) {printf(" !\n");break;}
n++;
s=s->next;
if (s==head) {
printf(" Loop\n");
break;
}
}
printf("将整个链表逆序:");//将整个链表逆序
if (n>=2) {
p=head;
while (1) {
q=p->prev;p->prev=p->next;p->next=q;
p=p->next;
if (p==head) break;
}
}
//输出整个循环双向链表
s=head;
while (1) {
if (NULL==s) {
printf("\n");
break;
}
printf("%02d(=)",s->data);
if (NULL!=s->next && s->next->prev!=s) {printf(" !\n");break;}
s=s->next;
if (s==head) {
printf(" Loop\n");
break;
}
}
m=4;
n=6;
printf("将循环双向链表中前%d个结点和后%d个结点进行互换:",m,n);//将循环双向链表中前m个结点和后n个结点进行互换,m+n为链表总长
k=0;
p=head;
while (1) {
if (NULL==p) {
break;
}
k++;
if (m==k) {
q=p;
break;
}
p=p->next;
if (p==head) break;
}
head=q->next;
//输出整个循环双向链表
s=head;
while (1) {
if (NULL==s) {
printf("\n");
break;
}
printf("%02d(=)",s->data);
if (NULL!=s->next && s->next->prev!=s) {printf(" !\n");break;}
s=s->next;
if (s==head) {
printf(" Loop\n");
break;
}
}
//释放所有节点
p=head;
while (1) {
if (NULL==p) {
break;
}
q=p->next;
free(p);
p=q;
if (p==head) {
break;
}
}
return 0;
}
//创建10个节点的循环双向链表:12(=)46(=)31(=)63(=)25(=)91(=)39(=)02(=)92(=)68(=) Loop
//将值为5的结点插入到循环双向链表的第3个结点前:12(=)46(=)05(=)31(=)63(=)25(=)91(=)39(=)02(=)92(=)68(=) Loop
//删除第5个节点:12(=)46(=)05(=)31(=)25(=)91(=)39(=)02(=)92(=)68(=) Loop
//从小到大排序:02(=)05(=)12(=)25(=)31(=)39(=)46(=)68(=)91(=)92(=) Loop
//将整个链表逆序:92(=)91(=)68(=)46(=)39(=)31(=)25(=)12(=)05(=)02(=) Loop
//将循环双向链表中前4个结点和后6个结点进行互换:39(=)31(=)25(=)12(=)05(=)02(=)92(=)91(=)68(=)46(=) Loop
//
sghcpt 2018-08-15
- 打赏
- 举报
楼主，可以试试下面的代码~~~~只供参考~~
/*这个程序是循环链表*/
/*这个程序是循环链表*/
#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>
typedef int DataType;
typedef struct node{
DataType data;
struct node *next;
}CurrNode;
//链表初始化
void CurrInit(CurrNode **head)
{
if ((*head = (CurrNode*)malloc(sizeof(CurrNode))) == NULL)
{
exit(1);
}
(*head)->next = *head;//构造循环链表
}
//链表长度返回
int Currlength(CurrNode *head)
{
CurrNode *per = head->next;
int num = 0;
while (per != head)//出现中断错误？
{
per = per->next;
num++;
}
return num;
}
//链表插入
int CurrInsert(CurrNode *head, int i, DataType x)
{
CurrNode *per, *fin;
int j = 0;
if ((fin = (CurrNode*)malloc(sizeof(CurrNode))) == NULL)
{
exit(1);
}
//per = head->next;
//while (per != head && j < i)
per = head;
while (j < i)
{
per = per->next;
j++;
}
if (j != i)
{
printf("插入位置错误！\n");
return 0;
}
fin->data = x;
fin->next = per->next;
per->next = fin;
return 1;
}
//链表删除
int CurrDelete(CurrNode *head, int i, DataType *x)
{
CurrNode *per, *tmp;
int j = 0;
per = head;
while (per->next != head && j < i - 1)
{
per = per->next;
j++;
}
if (j != i - 1)
{
printf("删除位置错误！\n");
return 0;
}
*x = per->next->data;
tmp = per->next;
per->next = per->next->next;
free(tmp);
return 1;
}
//链表取出
int CurrGet(CurrNode *head, int i, DataType *x)
{
CurrNode *per = head->next;
int j = 0;
while (per->next != head && j != i)
{
per = per->next;
j++;//失误
}
if (j != i)
{
printf("取出位置错误！\n");
return 0;
}
*x = per->data;
return 1;
}
//链表销毁
void CurrDestroy(CurrNode **head)
{
CurrNode *per = *head, *tmp;
while (per->next != *head)
{
tmp = per;
per = per->next;
free(tmp);
}
*head = NULL;
}
//主函数
int main()
{
CurrNode *mylist;
int i, x;
CurrInit(&mylist);
for (i = 0; i < 10; i++)
{
if ((CurrInsert(mylist, i, i + 1)) == 0)
{
printf("插入位置错误！\n");
return 0;
}
}
if ((CurrDelete(mylist, 9, &x)) == 0)
{
printf("删除位置错误！\n");
return 0;
}
else
{
printf("删除数字：%d\n", x);
}
for (i = 0; i < Currlength(mylist); i++)
{
if ((CurrGet(mylist, i, &x)) == 0)
{
printf("取出位置错误！\n");
return 0;
}
else
{
printf("%d ", x);
}
}
CurrDestroy(&mylist);
getchar();
return 0;
}蓝莓派Alex 2018-08-15
- 打赏
- 举报
谢谢，还是未解决断点问题。
/*这个程序是循环链表*/
#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>
typedef int DataType;
typedef struct node{
DataType data;
struct node *next;
}CurrNode;
//链表初始化
void CurrInit(CurrNode **head)
{
if ((*head = (CurrNode*)malloc(sizeof(CurrNode))) == NULL)
{
exit(1);
}
(*head)->next = head;//构造循环链表
}
//链表长度返回
int Currlength(CurrNode *head)
{
CurrNode *per = head->next;
int num = 0;
while (per!=head)//出现中断错误？
{
per = per->next;
num++;
}
return num;
}
//链表插入
int CurrInsert(CurrNode *head, int i, DataType x)
{
CurrNode *per, *fin;
int j = 0;
if ((fin=(CurrNode*)malloc(sizeof(CurrNode)))==NULL)
{
exit(1);
}
per = head->next;
while(per!=head/*&&per->next->next!=head*/&&j<i)
{
per = per->next;
j++;
}
if (j!=i)
{
printf("插入位置错误！\n");
return 0;
}
fin->data = x;
fin->next = per->next;
per->next = fin;
return 1;
}
//链表删除
int CurrDelete(CurrNode *head, int i, DataType *x)
{
CurrNode *per, *tmp;
int j = -1;
if ((tmp = (CurrNode*)malloc(sizeof(CurrNode))) == NULL)
{
exit(1);
}
per = head->next;
while (per->next != head&&j<i - 1)
{
per = per->next;
j++;
}
if (j != i - 1)
{
printf("删除位置错误！\n");
return 0;
}
*x = per->data;
tmp = per->next;
per->next = per->next->next;
free(tmp);
return 1;
}
//链表取出
int CurrGet(CurrNode *head, int i, DataType *x)
{
CurrNode *per=head->next;
int j = 0;
while (per->next!=head&&j != i)
{
per = per->next;
j++;//失误
}
if (j!=i)
{
printf("取出位置错误！\n");
return 0;
}
*x = per->data;
return 1;
}
//链表销毁
void CurrDestroy(CurrNode **head)
{
CurrNode *per = *head, *tmp;
if ((tmp = (CurrNode*)malloc(sizeof(CurrNode))) == NULL)
{
exit(1);
}
while (per->next != head)
{
tmp = per;
per = per->next;
free(tmp);
}
*head = NULL;
}
//主函数
int main()
{
CurrNode *mylist;
int i, x;
CurrInit(&mylist);
for ( i = 0; i < 10; i++)
{
if ((CurrInsert(mylist, i, i + 1)) == 0)
{
printf("插入位置错误！\n");
return ;
}
}
if ((CurrDelete(mylist, 5, &x)) == 0)
{
printf("删除位置错误！\n");
return;
}
else
{
printf("删除数字：%d\n", x);
}
for ( i = 0; i <Currlength(mylist); i++)
{
if ((CurrGet(mylist, i, &x)) == 0)
{
printf("取出位置错误！\n");
return;
}
else
{
printf("%d ",x);
}
}
CurrDestroy(&mylist);
getchar();
return 0;
}
以上是我梳理后的代码，还是出现中断错误，请大神指点。
还有请问怎么检测是否形成循环链表？
sghcpt 2018-08-15
- 打赏
- 举报
楼主，可遍历链表，看看链表尾部节点的next是否指向头节点。如果是，则说明是已经构成循环链表吧。。下面代码可供参考：
//判断是否构成循环链表
bool IsCyclicChainList(CurrNode* head)
{
int nNumber = Currlength(head);
CurrNode* pTemp = head;
int i = 0;
while (i < nNumber)
{
pTemp = pTemp->next;
i++;
}
return (pTemp->next == head) ? true : false;
}蓝莓派Alex 2018-08-15
- 打赏
- 举报
感谢，您的回复，程序运行正确。主要是改变了循环链表构造，循环判断条件和一些判断条件。
怎么判断这个链表是否已经构成循环链表呢？
zgl7903 2018-08-14
- 打赏
- 举报
while (per != NULL && per->next!=head) //先判断指针的有效性
