算法1：判断链表中是否有环

 

#include <stdio.h>

 

typedef struct list

{

    int data;

    struct list *next;

} LIST;

 

 

/* Method 1: check the occurrence of p->next from head to p */

int check_circle_1(LIST *head)

{

    LIST *p = head, *q= NULL;

      

    if (p == NULL)

        return 0;

      

    while (p->next)

       {

        /* check whether p points to itself */

        if (p->next == p)

              {

            return 1;

        }

             

        /* check the occurrence of p->next in head to p */

        q = head;

        while (q != p)

              {

            if (q == p->next) {

                return 1;

            }

            q = q->next;

        }

        p = p->next;

    }

      

    /* p->next is NULL, not a circle */

    return 0;

}

 

/* Method 2: q goes faster than p, if at last p == q, means there's circle */

/* 优点：逻辑上简单。 缺点：无法具体知道从哪个点拆开该圈 */

int check_circle_2(LIST *head)

{

    LIST *p, *q;

    p = head;

      

    if (p == NULL)

        return 0;

      

    q = p->next;

      

    while (p != NULL && q != NULL)

       {

        if (p == q)

              {

            return 1;

        }

        p = p->next;

        if (q->next == NULL)

              {

            return 0;

        }

              else

              {

            q = q->next->next;

        }

    }

    return 0;

}

 

int main()

{

    LIST a, b, c, *head = &a;

    a.next = &b;

    b.next = &c;

    c.next = &a;

    printf("%d/n", check_circle_1(head));

    printf("%d/n", check_circle_2(head));

}