From 08bfbd9bc739e9c0b91d107c6befee7776ce5c32 Mon Sep 17 00:00:00 2001 From: Adriana Gutierrez Date: Fri, 23 Dec 2022 13:09:11 -0500 Subject: [PATCH] solved --- linked_lists/intersection.py | 24 +++++++++++++++++++++++- 1 file changed, 23 insertions(+), 1 deletion(-) diff --git a/linked_lists/intersection.py b/linked_lists/intersection.py index f07e2ae..7c4afea 100644 --- a/linked_lists/intersection.py +++ b/linked_lists/intersection.py @@ -11,4 +11,26 @@ def intersection_node(headA, headB): """ Will return the node at which the two lists intersect. If the two linked lists have no intersection at all, return None. """ - pass \ No newline at end of file + listA = [] + listB = [] + + currA = headA + currB = headB + + while currA: + listA.append(currA) + currA = currA.next + while currB: + listB.append(currB) + currB = currB.next + + first_same_node = None + for i in range(1,min(len(listA)+1, len(listB)+1)): + if listA[-i] != listB[-i] and not first_same_node: + return None + elif listA[-i] != listB[-i]: + return first_same_node + else: + first_same_node = listA[-i] + return first_same_node + \ No newline at end of file