//两个链表有长度差,同一起点开始,总会相遇;
public class Solution {
public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
ListNode curA = headA;
ListNode curB = headB;
// 1. 肯定需要遍历链表,先确定链表的长度;
int lenA = 0, lenB = 0;
while (curA != null) { // 求链表A的长度
lenA++;
curA = curA.next;
}
while (curB != null) { // 求链表B的长度
lenB++;
curB = curB.next;
}
//2. 不改变结构, 定义两个指针;
curA = headA;
curB = headB;
//3. 让curA为最长链表的头,lenA为其长度;
// 如果两个链表长度不相等,让长的链表那个链表指针移动gap个位置,能直接找出答案;
if (lenB > lenA) {
//1. swap (lenA, lenB);
int tmpLen = lenA;
lenA = lenB;
lenB = tmpLen;
//2. swap (curA, curB);
ListNode tmpNode = curA;
curA = curB;
curB = tmpNode;
}
// 求长度差
int gap = lenA - lenB;
// 让curA和curB在同一起点上(末尾位置对齐)
while (gap-- > 0) {
curA = curA.next;
}
// 遍历curA 和 curB,遇到相同则直接返回
while (curA != null) {
if (curA == curB) {
return curA;
}
curA = curA.next;
curB = curB.next;
}
return null;
}
}
LeetCode 面试题 02.07链表相交
最新推荐文章于 2024-06-14 05:44:12 发布