Write a member function named consume that could be added to the LinkedIntList class.
Your function should accept as a parameter a reference to another LinkedIntList and not return anything.
After the call is done, all the elements from the second list should be appended to the end of the first one in the same order, and the second list should be empty.
Note that either linked list can be empty.
For example, if we start with the following two lists below, we would receive the following results:
| lists |
list1: {1, 3, 5, 7}
list2: {2, 4, 6}
|
after list1.consume(list2); |
list1: {1, 3, 5, 7, 2, 4, 6}
list2: {}
|
after list2.consume(list1); |
list1: {}
list2: {2, 4, 6, 1, 3, 5, 7}
|
Constraints:
Do not call any methods of the LinkedIntList class.
Do not construct any new ListNode objects in solving this problem (though you may create as many ListNode* pointer variables as you like).
Do not use any auxiliary data structures to solve this problem (no array, vector, stack, queue, string, etc).
Write the member function as it would appear in LinkedIntList.cpp.
You do not need to declare the function header that would appear in LinkedIntList.h.
Assume that you are adding this method to the LinkedIntList class as defined below:
class LinkedIntList {
private:
ListNode* front; // nullptr for an empty list
...
};
struct ListNode {
int data;
ListNode* next;
};
