Leetcode Problem 160. Intersection of Two Linked Lists

160. Intersection of Two Linked Lists

Leetcode Solutions

Initialize two pointers, pA and pB, to the heads of headA and headB respectively.
Traverse the lists with these pointers simultaneously.
When pA reaches the end of list A, redirect it to the head of list B. Do the same for pB when it reaches the end of list B.
If at any point pA and pB meet, return the node as the intersection.
If no intersection is found by the time both pointers have traversed both lists (i.e., both are null), return null.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen