题目:203 移除链表元素、707 设计链表、206 反转链表
打卡日期:2024.1.23、1.24
203 移除链表元素
链表操作的两种方式:
- 直接使用原来的链表进行删除操作
- 设置一个虚拟头结点再进行删除操作
注:一定要考虑节点非空的条件
不设置虚拟头结点
分情况讨论,移除头结点和其他节点的操作方式不同
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode* removeElements(ListNode* head, int val) {
// 删除头结点
while (head != NULL && head->val == val) { // 注意不是 if
ListNode* tmp = head;
head = head->next;
delete tmp; // 记得释放内存
}
// 删除其他节点
ListNode* cur = head;
while (cur != NULL && cur->next != NULL) { // 不要漏了cur->next非空条件
if (cur->next->val == val) {
ListNode* tmp = cur->next;
cur->next = cur->next->next;
delete tmp;
} else {
cur = cur->next;
}
}
return head;
}
};
时间复杂度:O(n)
空间复杂度:O(1)
设置虚拟头结点
删除头结点和其他节点的逻辑一样,无需分情况讨论
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode* removeElements(ListNode* head, int val) {
// 设置一个虚拟头结点
ListNode* dummyHead = new ListNode(0);
dummyHead->next = head;
ListNode* cur = dummyHead;
while(cur != NULL && cur->next != NULL) {
if (cur->next->val == val) {
ListNode* tmp = cur->next;
cur->next = cur->next->next;
delete tmp;
} else {
cur = cur->next;
}
}
head = dummyHead->next;
delete dummyHead;
return head;
}
};
时间复杂度:O(n)
空间复杂度:O(1)
707 设计链表
带虚拟头结点的单向链表
class MyLinkedList {
public:
// 定义链表节点结构体
struct LinkedNode {
int val;
LinkedNode* next;
LinkedNode(int val): val(val), next(nullptr){}
};
// 初始化链表
MyLinkedList() {
_dummyhead = new LinkedNode(0); // 定义一个虚拟头结点
_size = 0; // 因为要比较链表长度,所以设置一个_size
}
int get(int index) {
if (index >= _size || index < 0) {
return -1;
}
LinkedNode* cur = _dummyhead->next;
while (index--) {
cur = cur->next;
}
return cur->val;
}
void addAtHead(int val) {
LinkedNode* newNode = new LinkedNode(val);
LinkedNode* tmp = _dummyhead->next;
_dummyhead->next = newNode;
newNode->next = tmp;
_size++; // 不要忘了更新_size
}
void addAtTail(int val) {
LinkedNode* newNode = new LinkedNode(val);
LinkedNode* cur = _dummyhead;
while (cur->next != nullptr) {
cur = cur->next;
}
cur->next = newNode;
_size++;
}
void addAtIndex(int index, int val) {
// 非法
if (index < 0 || index > _size) {
return;
} else if (index == _size) { // 插入结尾,同addAtTail
LinkedNode* newNode = new LinkedNode(val);
LinkedNode* cur = _dummyhead;
while (cur->next != nullptr) {
cur = cur->next;
}
cur->next = newNode;
_size++;
} else { // 插入下标为index的节点之前
LinkedNode* newNode = new LinkedNode(val);
LinkedNode* cur = _dummyhead;
while (index--) {
cur = cur->next;
}
newNode->next = cur->next;
cur->next = newNode;
_size++;
}
}
void deleteAtIndex(int index) {
if (index < 0 || index > _size-1) {
return;
} else if (index == _size-1) { // 删除结尾
LinkedNode* cur = _dummyhead;
LinkedNode* deleteNode = nullptr;
while (cur->next->next != nullptr) {
cur = cur->next;
}
deleteNode = cur->next;
cur->next = nullptr;
delete deleteNode;
_size--;
} else { // 删除下标为index的节点
LinkedNode* cur = _dummyhead;
LinkedNode* deleteNode = nullptr;
while (index--) {
cur = cur->next;
}
deleteNode = cur->next;
cur->next = cur->next->next;
delete deleteNode;
_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);
*/
206 反转链表
(循环)迭代法(从前往后反转)
对每一个cur节点,记录前前后节点,改变其指向,当cur为空指针时迭代结束
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode* reverseList(ListNode* head) {
// 循环迭代
ListNode* cur = head;
ListNode* prev = nullptr;
ListNode* tmp; // 下一个要反转的节点
while (cur != nullptr) {
// 反向
tmp = cur->next;
cur->next = prev;
// 更新prev和cur
prev = cur;
cur = tmp;
}
return prev;
}
};
时间复杂度:O(n)
空间复杂度:O(1)
递归法-1(从前往后反转)
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode* reverse(ListNode* prev, ListNode* cur) {
if (cur == nullptr) {
return prev;
} else {
ListNode* tmp = cur->next; // 下一个要反转的节点
cur->next = prev;
// 递归的写法其实就是做了以下两步:更新prev和cur
// prev = cur;
// cur = tmp;
return reverse(cur, tmp);
}
}
ListNode* reverseList(ListNode* head) {
return reverse(nullptr, head);
}
};
时间复杂度:O(n),要递归处理链表的每个节点
空间复杂度:O(n),递归调用了n层栈空间(保存函数的状态)
递归法-2(从后往前反转)
未完待续(暂时无法实现)