leetcode: 707. Design Linked List
原题链接
设置一个虚拟头结点,方便处理
class MyLinkedList {
public:
// 定义链表结点结构体
struct LinkedNode {
int val;
LinkedNode* next;
//LinkedNode() : val(0), next(nullptr) {}
LinkedNode(int x) : val(x), next(nullptr) {}
//LinkedNode(int x, LinkedNode* next) : val(x), next(next) {}
};
MyLinkedList() {
_size = 0;
_dummyHead = new LinkedNode(0); // 虚拟头结点
}
int get(int index) {
if (index < 0 || index >= _size) return -1;
LinkedNode* cur = _dummyHead->next;
while (index--) { // 这里写成--index将导致死循环
cur = cur->next;
}
return cur->val;
}
void addAtHead(int val) {
LinkedNode* node = new LinkedNode(val);
node->next = _dummyHead->next;
_dummyHead->next = node;
_size++;
}
void addAtTail(int val) {
LinkedNode* cur = _dummyHead;
while (cur->next != nullptr) {
cur = cur->next;
}
LinkedNode* node = new LinkedNode(val);
cur->next = node;
_size++;
}
void addAtIndex(int index, int val) {
if (index > _size) return;
LinkedNode* cur = _dummyHead;
while (index--) {
cur = cur->next;
}
LinkedNode* node = new LinkedNode(val);
node->next = cur->next;
cur->next = node;
_size++;
}
void deleteAtIndex(int index) {
if (index < 0 || index >= _size) return;
LinkedNode* cur = _dummyHead;
while (index--) {
cur = cur->next;
}
LinkedNode* tmp = cur->next;
cur->next = tmp->next;
delete tmp;
_size--;
}
private:
int _size;
LinkedNode* _dummyHead;
};
/**
* Your MyLinkedList object will be instantiated and called as such:
* MyLinkedList* obj = new MyLinkedList();
* int param_1 = obj->get(index);
* obj->addAtHead(val);
* obj->addAtTail(val);
* obj->addAtIndex(index,val);
* obj->deleteAtIndex(index);
*/