#include <stdio.h>
#include <stdlib.h>
typedef struct node
{
int data;
struct node* next;
}node;
typedef node* Linklist;
Linklist H;//定义头指针
void initlink()
{
H = NULL;
printf("初始化成功!\n");
}
int insertlink(int i)
{
Linklist p = (node*)malloc(sizeof(node));
if (p == NULL)
{
printf("申请内存失败,抛出错误\n");
return 0;
}
if (H == NULL)
{
H = p;
p->next = NULL;
}
Linklist q = H;
while(q->next != NULL)
{
q = q->next;
}
q->next = p;
p->next = NULL;
return 1;
}
int iflink()//快慢指针
{
Linklist p1 = H;
Linklist p2 = H;
while(p2->next != NULL)
{
p2 = p2->next->next;
p1 = p1->next;
if (p2 == p1)
{
printf("链表有环!\n");
return 1;
}
}
printf("链表无环!\n");
return 0;
}
int iflink2()
{
//将链表遍历的每个节点的地址存储起来,遍历节点是与之匹配,若有相同则说明链表有环;
}
int main()
{
int i;
initlink();
printf("请插入数字构建单链表!\n");
for(i=0;i<10;i++)
{
scanf("%d",&i);
insertlink(i);
}//单链表建立完成
Linklist p = H;
while(p->next != NULL)
{
p = p->next;
}
p->next = H;//构建成环形链表
iflink();
return 0;
}
#include <stdlib.h>
typedef struct node
{
int data;
struct node* next;
}node;
typedef node* Linklist;
Linklist H;//定义头指针
void initlink()
{
H = NULL;
printf("初始化成功!\n");
}
int insertlink(int i)
{
Linklist p = (node*)malloc(sizeof(node));
if (p == NULL)
{
printf("申请内存失败,抛出错误\n");
return 0;
}
if (H == NULL)
{
H = p;
p->next = NULL;
}
Linklist q = H;
while(q->next != NULL)
{
q = q->next;
}
q->next = p;
p->next = NULL;
return 1;
}
int iflink()//快慢指针
{
Linklist p1 = H;
Linklist p2 = H;
while(p2->next != NULL)
{
p2 = p2->next->next;
p1 = p1->next;
if (p2 == p1)
{
printf("链表有环!\n");
return 1;
}
}
printf("链表无环!\n");
return 0;
}
int iflink2()
{
//将链表遍历的每个节点的地址存储起来,遍历节点是与之匹配,若有相同则说明链表有环;
}
int main()
{
int i;
initlink();
printf("请插入数字构建单链表!\n");
for(i=0;i<10;i++)
{
scanf("%d",&i);
insertlink(i);
}//单链表建立完成
Linklist p = H;
while(p->next != NULL)
{
p = p->next;
}
p->next = H;//构建成环形链表
iflink();
return 0;
}