题目描述
输入两个链表,找出它们的第一个公共结点。
思路:单链表,第一个公共节点后的子链必是一致的,所以先将两个链从前截取长度一致,再一起遍历即可。
/*
public class ListNode {
int val;
ListNode next = null;
ListNode(int val) {
this.val = val;
}
}*/
public class Solution {
public ListNode FindFirstCommonNode(ListNode pHead1, ListNode pHead2) {
int count=1;
ListNode root1=pHead1;
ListNode root2=pHead2;
while(pHead1!=null)
{
count++;
pHead1=pHead1.next;
}
int length1 = count;
count =1;
while(pHead2!=null)
{
count++;
pHead2=pHead2.next;
}
int length2 = count;
pHead1=root1;
pHead2=root2;
if(length1>=length2)
for(int i=0;i<length1-length2;i++)
pHead1=pHead1.next;
else
for(int i=0;i<length2-length1;i++)
pHead2=pHead2.next;
while(pHead1!=null)
{
if(pHead1==pHead2)
return pHead1;
pHead1=pHead1.next;
pHead2=pHead2.next;
}
return null;
}
}