class Solution {
public:
ListNode* removeElements(ListNode* head, int val) {
ListNode* dummyHead = new ListNode(0);
dummyHead->next = head;
ListNode* cur = dummyHead;
while (cur->next != nullptr) {
if (cur->next->val == val) {
cur->next = cur->next->next;
} else {
cur = cur->next;
}
}
return dummyHead->next;
}
};
class MyLinkedList {
public:
struct LinkedNode {
int val;
LinkedNode* next;
LinkedNode(int val):val(val), next(nullptr){}
};
MyLinkedList() {
_dummyHead = new LinkedNode(0);
_size = 0;
}
int get(int index) {
if (index < 0 || index > (_size - 1)) {
return -1;
}
LinkedNode* cur = _dummyHead->next;
while (index > 0) {
index--;
cur = cur->next;
}
return cur->val;
}
void addAtHead(int val) {
LinkedNode* newHead = new LinkedNode(val);
newHead->next = _dummyHead->next;
_dummyHead->next = newHead;
_size++;
}
void addAtTail(int val) {
LinkedNode* newTail = new LinkedNode(val);
LinkedNode* cur = _dummyHead;
while (cur->next != nullptr) {
cur = cur->next;
}
cur->next = newTail;
_size++;
}
void addAtIndex(int index, int val) {
if (index < 0 || index > _size) {
return;
}
LinkedNode* cur = _dummyHead;
while (index > 0) {
index--;
cur = cur->next;
}
LinkedNode* newNode = new LinkedNode(val);
newNode->next = cur->next;
cur->next = newNode;
_size++;
}
void deleteAtIndex(int index) {
if (index < 0 || index > (_size - 1)) {
return;
}
LinkedNode* cur = _dummyHead;
while (index > 0) {
index--;
cur = cur->next;
}
LinkedNode* temp = cur->next;
cur->next = cur->next->next;
delete temp;
_size--;
}
void printfLinkedNode() {
LinkedNode* cur = _dummyHead;
while (cur->next != nullptr) {
cout << cur->next->val << " ";
cur = cur->next;
}
cout << endl;
}
private:
int _size;
LinkedNode* _dummyHead;
};
class Solution {
public:
ListNode* reverseList(ListNode* head) {
ListNode* cur = head;
ListNode* pre = nullptr;
ListNode* temp = nullptr;
while (cur != nullptr) {
temp = cur->next;
cur->next = pre;
pre = cur;
cur = temp;
}
return pre;
}
};
小结:
- 节点的位置 即 index 从 0 开始,明确要使哪个节点为第 0 个节点
删除指定位置的节点时,应该使 dummyHead 为第 0 个节点,方便查找到被删除节点的前一个节点 - 清楚什么时候使用
cur = dummyHead->next
,什么时候使用 cur = dummyHead
cur = dummyHead->next
表明第 0 个节点为头节点
cur = dummyHead
表明第 0 个节点为dummyHead
与小结 1 配合使用 - 在循环中什么时候使用
cur != nullptr
,什么时候使用cur->next != nullptr
使用cur != nullptr
则 cur
可以到达最后一个节点的指针域
使用cur->next != nullptr
则 cur
只可以到达最后一个节点,而无法到达其指针域