判断两个单链表（无环）是否交叉

bool IsIntersect(Node *list1,Node *list2,Node *&value)
{//判断两个单链表(无环)是否交叉
	value = NULL;
	if(NULL == list1 || NULL == list2)
		return false;

	Node *temp = list1,*temp2 = list2;
	int len1 = 0,len2 = 0;

	while(NULL != temp1->next)
	{
		temp1 = temp1->next;
		len1++;
	}
	while(NULL != temp2->next)
	{
		temp2 = temp2->next;
		len2++;
	}

	if(temp1 == temp2)
	{

		if(len1 > len2)                    //如果list1 长，list1先走len1 - len2步
			while(len1 - len2 >0)
			{
				list1 = list->next;
				len1--;
			}
		if(len2 > len1)                    //如果list2 长，list2先走len2 - len1步
			while(len2 - len1 >0)
			{
				list2 = list2->next;
				len2--;
			}
		while(list1 != list2)             //list1、list2一起走，碰到相同的结点就是交点
		{
			list1 = list1->next;
			list2 = list2->next;
		}
		value = list1;
		return true;		
	}
	else
		return false;
}