Problem
Given two Linked Lists, create union and intersection lists that contain union and intersection of the elements present in the given lists. Order of elments in output lists doesn’t matter.Example
Input: List1: 10->15->4->20 lsit2: 8->4->2->10 Output: Intersection List: 4->10 Union List: 2->8->20->4->15->10
Solution
Method 1 - SimpleFollowing are simple algorithms to get union and intersection lists respectively.
Intersection (list1, list2)
Initialize result list as NULL. Traverse list1 and look for its each element in list2, if the element is present in list2, then add the element to result.
Union (list1, list2):
Initialize result list as NULL. Traverse list1 and add all of its elements to the result.
Traverse list2. If an element of list2 is already present in result then do not insert it to result, otherwise insert.
This method assumes that there are no duplicates in the given lists.
Java code:
bool isPresent (Node head, int data)
{
Node t = head;
while (t != NULL)
{
if (t.data == data)
return true;
t = t.next;
}
return false;
}
// Function to get union of two linked lists head1 and head2 /
Node getUnion (Node head1, Node head2)
{
Node result = NULL;
Node t1 = head1, t2 = head2;
// Insert all elements of list1 to the result list
while (t1 != NULL)
{
push(&result, t1.data);
t1 = t1.next;
}
// Insert those elements of list2 which are not present in result list
while (t2 != NULL)
{
if (!isPresent(result, t2.data))
push(&result, t2.data);
t2 = t2.next;
}
return result;
}
// Function to get intersection of two linked lists head1 and head2
Node getIntersection (Node head1, Node head2)
{
Node result = NULL;
Node t1 = head1;
// Traverse list1 and search each element of it in list2. If the element
// is present in list 2, then insert the element to result
while (t1 != NULL)
{
if (isPresent(head2, t1.data))
push (&result, t1.data);
t1 = t1.next;
}
return result;
}
// A utility function to insert a node at the begining of a linked list/
void push (Node headRef, int newData)
{
// allocate node /
Node newNode = new Node();
// put in the data /
newNode.data = newData;
// link the old list off the new node /
newNode.next = (headRef);
// move the head to point to the new node /
(headRef) = newNode;
}
Time Complexity: O(mn) for both union and intersection operations.Here m is the number of elements in first list and n is the number of elements in second list.
Method 2 - Use Merge Sort
In this method, algorithms for Union and Intersection are very similar. First we sort the given lists, then we traverse the sorted lists to get union and intersection.
Following are the steps to be followed to get union and intersection lists.
1) Sort the first Linked List using merge sort. This step takes O(mLogm) time. Refer this post for details of this step.
2) Sort the second Linked List using merge sort. This step takes O(nLogn) time. Refer this post for details of this step.
3) Linearly scan both sorted lists to get the union and intersection. This step takes O(m + n) time. This step can be implemented using the same algorithm as sorted arrays algorithm discussed here.
Time complexity of this method is O(mLogm + nLogn) which is better than method 1′s time complexity.
Method 3 (Use Hashing)
Union (list1, list2)
Initialize the result list as NULL and create an empty hash table. Traverse both lists one by one, for each element being visited, look the element in hash table. If the element is not present, then insert the element to result list. If the element is present, then ignore it.
Intersection (list1, list2)
Initialize the result list as NULL and create an empty hash table. Traverse list1. For each element being visited in list1, insert the element in hash table. Traverse list2, for each element being visited in list2, look the element in hash table. If the element is present, then insert the element to result list. If the element is not present, then ignore it.
Both of the above methods assume that there are no duplicates.
Time complexity of this method depends on the hashing technique used and the distribution of elements in input lists. In practical, this approach may turn out to be better than above 2 methods.
References
