struct Node {
Node(int _val, Node* _next) :val(_val), next(_next) {};
int val;
Node* next;
};
class MyLinkedList {
public:
/** Initialize your data structure here. */
MyLinkedList() {
mHead = new Node(0, nullptr);
mSize = 0;
}
/** Get the value of the index-th node in the linked list. If the index is invalid, return -1. */
int get(int index) {
// terminal condition: fail
if (index < 0 || index >= mSize)
{
return -1;
}
// get function core
Node* p = mHead->next;
while (index--)
{
p = p->next;
}
return p->val;
}
/** Add a node of value val before the first element of the linked list. After the insertion, the new node will be the first node of the linked list. */
void addAtHead(int val) {
addAtIndex(0, val);
}
/** Append a node of value val to the last element of the linked list. */
void addAtTail(int val) {
addAtIndex(mSize, val);
}
/** Add a node of value val before the index-th node in the linked list. If index equals to the length of linked list, the node will be appended to the end of linked list. If index is greater than the length, the node will not be inserted. */
void addAtIndex(int index, int val) {
// terminal condition: fail
if (index < 0 || index > mSize)
{
return;
}
Node* p = mHead;
while (index--)
{
p = p->next;
}
Node* newNode = new Node(val, p->next);
p->next = newNode;
mSize++;
}
/** Delete the index-th node in the linked list, if the index is valid. */
void deleteAtIndex(int index) {
// terminal condition: fail
if (index < 0 || index >= mSize)
{
return;
}
// function core
Node* p = mHead;
while (index--)
{
p = p->next;
}
p->next = p->next->next;
mSize--;
}
private:
Node* mHead;
int mSize;
};