91精品综合久久久久m3u8,国产真人一级a视频

#include<stdio.h>
#include<stdlib.h>
//自定義 bool 類型
typedef enum Bool
{
False=0,
True=1
}Bool;
typedef struct link{
int data;
struct link* next;
}link;
link *linkIint(int n)
{
link *head=(link*)malloc(sizeof(link));
head->data=1;
head->next=NULL;
link *phead=head;
int i;
for(i=2;i<=n;i++)
{
link *temp=(link*)malloc(sizeof(link));
temp->data=i;
temp->next=NULL;
head->next=temp;
head=head->next;
}
head->next=phead;
return phead;
}
#if 1
Bool HaveRing(link *temp)
{
link *H2=temp;
link *H1=temp->next;
if(H2==NULL||H2==NULL)
{
return False;
}
while(H1)
{
if(H1==H2)
{
printf("this links have a ring\n");
return True;
}
else
{
H1=H1->next;
if (!H1)
{
printf("this links no ring\n");
return False;
}
else
{
H1=H1->next;
H2=H2->next;
}
}
}
//鏈表中無環(huán)
printf("this links no ring\n");
return False;
}
#else
Bool HaveRing(link *H)
{
link * Htemp = H;
//存儲(chǔ)所遍歷節(jié)點(diǎn)所有前驅(qū)節(jié)點(diǎn)的存儲(chǔ)地址，64位環(huán)境下地址占 8 個(gè)字節(jié)，所以這里用 long long 類型
long long addr[20] = { 0 };
int length = 0, i = 0;
if(Htemp==NULL||Htemp->next==NULL)
{
return False;
}
//逐個(gè)遍歷鏈表中各個(gè)節(jié)點(diǎn)
while (Htemp) {
//依次將 Htemp 和 addr 數(shù)組中記錄的已遍歷的地址進(jìn)行比對
for (i = 0; i < length; i++) {
//如果比對成功，則證明有環(huán)
if (Htemp == (link*)addr[i]) {
return True;
}
}
//比對不成功，則記錄 Htemp 節(jié)點(diǎn)的存儲(chǔ)地址
addr[length] = (long long)Htemp;
length++;
Htemp = Htemp->next;
}
return False;
}
#endif
void linkPrint(link *temp)
{
link *phead=temp;
if(!temp)
printf("the link is empty\n");
else
{
while(temp)
{
printf("%d\t",temp->data);
temp=temp->next;
if(temp==phead)
{
printf("\r\n");
break;
}
}
}
}
int main()
{
link *head=linkIint(6);
linkPrint(head);
if(HaveRing(head)==True)
{
printf("the link has a ring\r\n");
}
else
{
printf("the link no rave\r\n");
}
return 0;
}

復(fù)制代碼