/* public class ListNode { int val; ListNode next = null; ListNode(int val) { this.val = val; } }*/ public class Solution { public ListNode FindFirstCommonNode(ListNode node, ListNode pHead2) { //暴力解法：两个指针分别指向两个链表 //然后依次访问链表2中节点，并且每次访问链表2中节点时都要完整遍历链表1 ...
