判断两个无环链表是否相交

题目：给定两个无环的单链表，判断两者是否相交（即有共同的节点）。

思路：可以将其中一个链表连接到另一个链表尾部，并通过判定得到新的链表是否有环来确定两个链表是否相交。

代码：

#include <cstdio>

typedef struct node
{
    struct node* next;
}Node, *pNode;

int bListIntersect (Node list1, Node list2);

int main (int argc, char** argv)
{
    Node n1, n2, n3, n4, n5, n6, n7, n8, n9, n10;
    n1.next = &n2;
    n2.next = &n3;
    n3.next = &n4;
    n4.next = NULL;

    n5.next = &n6;
    n6.next = &n7;
    n7.next = NULL;

    n8.next = &n9;
    n9.next = &n10;
    n10.next = &n3;

    printf(bListIntersect(n1, n5) == 1?"intersect
":"not intersect
");
    printf(bListIntersect(n1, n8) == 1?"intersect
":"not intersect
");

    return 0;
}

int bListIntersect (Node list1, Node list2)
{
    pNode p, q;
    p = &list1;
    while (p->next != NULL)
    {
        p = p->next;
    }

    p->next = &list2;
    q = p;
    p = p->next;
    while ((p != NULL) && (p != q))
    {
        p = p->next;
    }
    q->next = NULL;
    return (p == NULL) ? 0 : 1;
}