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

/*
struct ListNode {
	int val;
	struct ListNode *next;
	ListNode(int x) :
			val(x), next(NULL) {
	}
};*/
class Solution {
public:
    ListNode* FindFirstCommonNode( ListNode* pHead1, ListNode* pHead2) {
        ListNode *list1=pHead1;
		ListNode *list2=pHead2;
		while(list1!=list2) {
			list1 = (list1==NULL)?pHead2:list1->next;
			list2 = (list2==NULL)?pHead1:list2->next;
		}
		return list1;
    }
};