题解 | #两个链表的第一个公共结点#暴力循环两个链表

import java.util.*;
/*
public class ListNode {
    int val;
    ListNode next = null;

    ListNode(int val) {
        this.val = val;
    }
}*/
public class Solution {
    public ListNode FindFirstCommonNode(ListNode pHead1, ListNode pHead2) {
        // 暴力循环两个链表
        
        while (pHead1 != null) {
            ListNode temp = pHead2;
            while(temp != null) {
                if(pHead1.val == temp.val && pHead1 == temp) { 
                    return pHead1;
                }
                temp = temp.next;
            }
            pHead1 = pHead1.next;
        }
        return null;
    }
}