剑指数据结构-两个链表的第一个公共节点

/*
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 || !pHead2  ) return NULL;
        ListNode *p1 = pHead1, *p2 = pHead2;
        while(p1 !=p2){
            p1 = p1?p1->next: pHead2;
            p2 = p2?p2->next: pHead1;
        }
        
        return p1;
    }
};