考点
1.链表的常见操作()
- 获取链表第index个节点的数值
- 在链表的最前面插入一个节点
- 在链表的最后面插入一个节点
- 在链表第index个节点前面插入一个节点
- 删除链表的第index个节点
思路
最关键的点是如何在这个类中构建虚拟头结点
代码
class MyLinkedList {
public:
struct ListNode
{
int val;
ListNode *next;
ListNode(int val): val(val), next(nullptr){}
};
MyLinkedList() {
_dummyHead = new ListNode(0);
_size = 0;
}
int get(int index) {
if(index > (_size-1) || index < 0)
return -1;
ListNode *cur = _dummyHead->next;
while(index--)
{
cur = cur->next;
}
return cur->val;
}
void addAtHead(int val) {
ListNode *newNode = new ListNode(val);
newNode->next = _dummyHead->next;
_dummyHead->next = newNode;
_size++;
}
void addAtTail(int val) {
ListNode *newNode = new ListNode(val);
ListNode *cur = _dummyHead;
while(cur->next != nullptr)
{
cur = cur->next;
}
cur->next = newNode;
_size++;
}
void addAtIndex(int index, int val) {
if(index > _size)
return;
if(index < 0)
index = 0;
ListNode *newNode = new ListNode(val);
ListNode *cur = _dummyHead;
while(index--)
{
cur = cur->next;
}
newNode->next = cur->next;
cur->next = newNode;
_size++;
}
void deleteAtIndex(int index)
{
if(index < 0 || index >= _size)
return;
{
ListNode *cur = _dummyHead;
while(index--)
{
cur = cur->next;
}
ListNode *tmp = cur->next;
cur->next = cur->next->next;
delete tmp;
tmp = nullptr;
_size--;
}
}
private:
int _size;
ListNode *_dummyHead;
};