题目描述
输入两个链表,找出它们的第一个公共结点。
思路:公共结点前两链表的结点数不一定相等,公共结点后两链表结点数一样。先把长度差补上,然后开始同时遍历。
代码实现:
public class ListNode {
int val;
ListNode next = null;
ListNode(int val) {
this.val = val;
}
}*/
public class Solution {
public ListNode FindFirstCommonNode(ListNode pHead1, ListNode pHead2) {
//1.链表1长度
int len1 = 0;
ListNode l1 = pHead1;
while(l1 != null){
len1++;
l1 = l1.next;
}
//2.链表2长度
int len2 = 0;
ListNode l2 = pHead2;
while(l2 != null){
len2++;
l2 = l2.next;
}
//3.长度差
int sub = 0;
int flag =1;//长度标识位,默认为1长
if(len1 > len2){
sub = len1 - len2;
}else{
sub = len2 - len1;
flag = 2;
}
//4.补差
if(flag == 1){
for(int i=0;i<sub;i++){
pHead1 = pHead1.next;
}
}else{
for(int i=0;i<sub;i++){
pHead2 = pHead2.next;
}
}
//5.同时移动,寻找公共结点
while(pHead1!=null || pHead2!=null){
if(pHead1 == pHead2){
return pHead1;
}
pHead1 = pHead1.next;
pHead2 = pHead2.next;
}
return null;
}