Leetcode 160 Intersection of Two Linked Lists Solution in c++ | Hindi Coding Community

 

Given the heads of two singly linked-lists headA and headB, return the node at which the two lists intersect. If the two linked lists have no intersection at all, return null.

The test cases are generated such that there are no cycles anywhere in the entire linked structure.

Note that the linked lists must retain their original structure after the function returns.

class Solution {

public:

    ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {

        ListNode *a = headA, *b = headB;

        while (a != b) {

            a = !a ? headB : a->next;

            b = !b ? headA : b->next;

        }

        return a;

    }

};