本来以为偷鸡了,但想起这道题双指针做法背后那个浪漫故事——我追寻你走过的路,终有一天会与你相遇。我这个就是悲惨世界了orz
一辈子追寻你的脚印,可时间让一切都化为泡影
// 冲刺019
public class Solution {
final int v = 100001;
public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
ListNode a = headA;
ListNode b = headB;
while (a != null) {
a.val -= v;
a = a.next;
}
while (b != null) {
if (b.val < 0) {
back(headA);
return b;
}
b = b.next;
}
back(headA);
return null;
}
void back(ListNode head) {
ListNode node = head;
while (node != null) {
node.val += v;
node = node.next;
}
}
}