判断链表是否相交

struct Node
{
	int val;
	Node *next;
	Node(int val_in):val(val_in), next(NULL)
	{
		
	}
};
Node* getTail(Node* head)
{
	if(NULL == head)
		return NULL;
	while(NULL != head->next)
		head = head->next;
	return head;
}

bool hasIntersection(Node* heada, Node* headb)
{
	if(NULL == heada && NULL == headb)
		return false;
	return getTail(heada) == getTail(headb);
}