Write a c++ program which creates a Linked List having maximum sum out of two Sorted Linked Lists.
Question : Write a c++ program which creates a Linked List having maximum sum out of two Sorted Linked Lists.
Use this : LinkedList finalMaxSumList(LinkedList List1, LinkedList List2);
For eg: You have two sorted linked lists, create a linked list that contains data with maximum sum. The resulting list with maximum sum will contain nodes with data from both input sorted lists. While creating the resulting list with maximum sum, we may switch to the other input list only at the point of intersection (which mean the two nodes with the same value in the lists). You are only allowed to use O(1) extra space.
Note: You have to returned Linked List which contain finalMaxSumList and you are not allowed to change in data type and prototype of the Function.
Input:
List1 = 1->3->30->90->120->240->511
List2 = 0->3->12->32->90->125->240->249
Returned LinkedList:
Following is resulting linked list out of two sorted lists
ResultingList = 1->3->12->32->90->125->240->511
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
