题目描述
输入两个链表,找出它们的第一个公共结点。
/*
public class ListNode {
int val;
ListNode next = null;
ListNode(int val) {
this.val = val;
}
}*/
//直接比就完事了
public class Solution {
public ListNode FindFirstCommonNode(ListNode pHead1, ListNode pHead2) {
ListNode l1=pHead1,l2=pHead2;
while(l1!=l2){
l1=l1==null?pHead2:l1.next;
l2=l2==null?pHead1:l2.next;
}
return l1;
}
}