Enter two linked lists and find their first common node.

/*
public class ListNode {
    int val;
    ListNode next = null;

    ListNode(int val) {
        this.val = val;
    }
}*/
public class Solution {
    public ListNode FindFirstCommonNode(ListNode pHead1, ListNode pHead2) {
        if(pHead1 == null || pHead2 == null){
            return null;
        }
        ListNode p1 = pHead1;
        ListNode p2 = pHead2;
        while(p1 ! P1 = (p1==null) {p1= (p1==null); pHead2:p1.next; p2 = (p2==null)? pHead1:p2.next; } // if p1 is not null, p1 is already nullreturnp1; }}Copy the code