Given two lists sorted in increasing order, create and return a new list representing the intersection of the two lists. The new list should be made with its own memory — the original lists should not be changed.
Example:
Input: First linked list: 1->2->3->4->6 Second linked list be 2->4->6->8, Output: 2->4->6. The elements 2, 4, 6 are common in both the list so they appear in the intersection list. Input: First linked list: 1->2->3->4->5 Second linked list be 2->3->4, Output: 2->3->4 The elements 2, 3, 4 are common in both the list so they appear in the intersection list.
Method: Using Dummy Node.
Approach:
The idea is to use a temporary dummy node at the start of the result list. The pointer tail always points to the last node in the result list, so new nodes can be added easily. The dummy node initially gives the tail a memory space to point to. This dummy node is efficient, since it is only temporary, and it is allocated in the stack. The loop proceeds, removing one node from either ‘a’ or ‘b’ and adding it to the tail. When the given lists are traversed the result is in dummy. next, as the values are allocated from next node of the dummy. If both the elements are equal then remove both and insert the element to the tail. Else remove the smaller element among both the lists.
Below is the implementation of the above approach:
Javascript
// Javascript program to implement // the above approach <script> // Head nodes for pointing to // 1st and 2nd linked lists var a = null, b = null; // Dummy node for storing intersection var dummy = null; // Tail node for keeping track of // last node so that it makes easy // for insertion var tail = null; // class - Node class Node { constructor(val) { this.data = val; this.next = null; } } // Function for printing the list function printList(start) { var p = start; while (p != null) { document.write(p.data + " "); p = p.next; } document.write(); } // Inserting elements into list function push(data) { var temp = new Node(data); if (dummy == null) { dummy = temp; tail = temp; } else { tail.next = temp; tail = temp; } } // Function for finding intersection // and adding it to dummy list function sortedIntersect() { // pointers for iterating var p = a, q = b; while (p != null && q != null) { if (p.data == q.data) { // Add to dummy list push(p.data); p = p.next; q = q.next; } else if (p.data < q.data) p = p.next; else q = q.next; } } // Driver code // Creating first linked list a = new Node(1); a.next = new Node(2); a.next.next = new Node(3); a.next.next.next = new Node(4); a.next.next.next.next = new Node(6); // Creating second linked list b = new Node(2); b.next = new Node(4); b.next.next = new Node(6); b.next.next.next = new Node(8); // Function call for intersection sortedIntersect(); // Print required intersection document.write( "Linked list containing common items of a & b<br/>"); printList(dummy); // This code is contributed by todaysgaurav </script> |
Output:
Linked list containing common items of a & b 2 4 6
Complexity Analysis:
- Time Complexity: O(m+n) where m and n are number of nodes in first and second linked lists respectively.
Only one traversal of the lists are needed. - Auxiliary Space: O(min(m, n)).
The output list can store at most min(m,n) nodes .
Please refer complete article on Intersection of two Sorted Linked Lists for more details!
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
