Write a member function named rotate that could be added to the LinkedIntList class.
Your function should move the value at the front of a list of integers to the end of the list.
For example, suppose a variable named list stores the following sequence of values:
{8, 23, 19, 7, 45, 98, 102, 4}
The call of list.rotate(); should move the value 8 from the front of the list to the back, yielding this sequence of values:
{23, 19, 7, 45, 98, 102, 4, 8}
The other values in the list should retain the same order as in the original list.
If the method is called for a list of 0 or 1 elements it should have no effect on the list.
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;
};
