Write a member function named split that could be added to the LinkedIntList class.
Your function should rearrange the elements of the list so that all negative values appear before all of the non-negatives.
The negatives should also appear in the opposite relative order that they appeared in the original list.
For example, suppose a variable named list stores the following sequence of values:
{8, 7, -4, 19, 0, 43, -8, -7, 2}
The call of list.split(); should modify the list to contain the following elements, in exactly this order.
Notice that the negatives were in the relative order -7, -8, -4 in the original list and are in the relative order -4, -8, -7 after the call.
{-7, -8, -4, 8, 7, 19, 0, 43, 2}
Constraints:
Do not call any methods of the LinkedIntList class.
Do not modify the data field of existing nodes; change the list by changing pointers only.
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;
};
