Write a function named setValue that accepts a reference to a pointer to a ListNode representing the front of a linked list, along with an index and a value.
Your function should modify the node at the given 0-based index in the list so that it stores the given value.
For example, suppose a variable named front points to the front of a list containing the following sequence of values:
{8, 23, 46, 7, 102}
The call of setValue(front, 2, 9999); should modify the data of the node at index 2, so that the list's state will be the following:
{8, 23, 9999, 7, 102}
The other values in the list should retain the same order as in the original list.
You may assume that the index passed is between 0 and the existing size of the list minus 1, inclusive.
Constraints:
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).
Assume that you are using the ListNode structure as defined below:
struct ListNode {
int data; // value stored in each node
ListNode* next; // pointer to next node in list (nullptr if none)
}
