题解 | #两个链表的第一个公共结点#

/*
struct ListNode {
	int val;
	struct ListNode *next;
	ListNode(int x) :
			val(x), next(NULL) {
	}
};*/
class Solution {
public:
    ListNode* FindFirstCommonNode( ListNode* pHead1, ListNode* pHead2) {
        if(pHead1==nullptr||pHead2==nullptr)
			return nullptr;
		ListNode* ta = pHead1;
		ListNode* tb = pHead2;

		while(ta!=tb)
		{
			ta = ta ? ta->next:pHead2;
			tb = tb ? tb->next:pHead1;
		}
		return ta;
    }
};