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

/*
struct ListNode {
	int val;
	struct ListNode *next;
	ListNode(int x) :
			val(x), next(NULL) {
	}
};*/
class Solution {
public:
    ListNode* FindFirstCommonNode( ListNode* pHead1, ListNode* pHead2) {
        ListNode* p1 = pHead1;
		ListNode* p2 = pHead2;
		while(p1 != p2){
			if(p1 == nullptr){
				p1 = pHead2;
			}else{
				p1 = p1 -> next;
			}
			if(p2 == nullptr){
				p2 = pHead1;
			}else{
				p2 = p2 -> next;
			}
		}
		return p1;
    }
};

三元运算符可以用来替换if else