160. Intersection of Two Linked Lists - Leetcode

#algorithms #leetcode

Naive Approach :

Find the length of both the lists
Find the difference in the length of both the lists
Then start checking the equality for the nodes
Once we find equal node return that node
otherwise if we reach at the end return the null

There is a better way to do it:

We are going to traverse the shorter one and longer one at the same time
We are going to set pointers to the heads of both of these.
When we get at the end of the shorter one, we set the pointer to the head of the longer one.
When we get at the end of the longer one, we set the pointer to the head of the shorter one.

Here, is the code of the implementation

class Solution {
public:
    ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {

        if(headA == NULL|| headB == NULL) return NULL;
        ListNode*a_pointer = headA;
        ListNode*b_pointer = headB;

        //while the nodes are not equal 
        while(a_pointer != b_pointer ){
            if(a_pointer == NULL){
              //this means it is at the end of the list 
                a_pointer = headB;   
            } 

        else{
            a_pointer = a_pointer->next;
        }

              if(b_pointer == NULL){
               //this means it is at the end of the list 
                b_pointer = headA;   
              } 

        else{
            b_pointer = b_pointer->next;
        }
        }
        return a_pointer;
    }
};

DEV Community

160. Intersection of Two Linked Lists - Leetcode

Naive Approach :

There is a better way to do it:

Here, is the code of the implementation

Top comments (0)

Read next

864. Shortest Path to Get All Keys || Leetcode || Hard

"Why We Need Algorithms: The Foundation of Efficiency, Automation, and Problem Solving"

Doubly Linked List Implementation in Go

Remove Methods from project