Question

试编写一个算法,计算带头结点的循环单链表的长度

c语言

Answer 1

int Len(Node *head)
{
Node *ps;
int count = 0;
ps = head;
if(ps == NULL)
return 0;
else
{
while(ps->next != head)
{
count++;
ps = ps->next;
}
return count;
}
}

Answer 2

int length(struct list * head)
{
int i = 0;
struct list *tmp;
if( head == NULL)
return 0;
if( head -> next == head)
return 1;
tmp = head->next;
while(
return i;

Answer 3

int length(struct list * head)
{
int i = 0;
struct list *tmp;
if( head == NULL)
return 0;
if( head -> next == head)
return 1;
tmp = head->next;
while(tmp != head)
{
i++;
tmp = tmp -> next;
}
return i;
}