一、203. 移除链表元素
题目链接:https://leetcode.cn/problems/remove-linked-list-elements/
1、解法:善用虚拟头节点,增加一个虚拟的头节点,可以不用讨论删除头节点这种情况。还有就是如果使用cpp的话要注意delete掉删除的节点。
/**
* 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 *dummyNode = new ListNode(0);
dummyNode->next = head;
ListNode *cur = dummyNode;
while(cur->next!=nullptr){
if(cur->next->val == val){
ListNode *tmp = cur->next;
cur->next = cur->next->next;
delete tmp;
}else{
cur = cur->next;
}
}
head = dummyNode->next;
delete dummyNode;
return head;
}
};
2、707. 设计链表
题目链接:https://leetcode.cn/problems/design-linked-list/
class MyLinkedList {
public:
// 定义链表节点结构体
struct LinkedNode {
int val;
LinkedNode* next;
LinkedNode(int val):val(val), next(nullptr){}
};
MyLinkedList() {
_node = new LinkedNode(0);
_length = 0;
}
int get(int index) {
//bug:边界条件没有使index > length-1,而是大于Length,导致一部分测试用例不过
if(index < 0 || index > _length-1){
return -1;
}
LinkedNode *cur = _node->next;
for(int i = 0; i < index; i++){
if(cur->next!=nullptr){
cur = cur->next;
}
}
return cur->val;
}
void addAtHead(int val) {
LinkedNode *head = new LinkedNode(val);
head->next = _node->next;
_node->next = head;
_length++;
}
void addAtTail(int val) {
LinkedNode *tail = new LinkedNode(val);
LinkedNode *cur = _node;
while(cur->next != nullptr){
cur = cur->next;
}
cur->next = tail;
_length++;
}
void addAtIndex(int index, int val) {
if(index > _length){
return;
}
if(index < 0){
index = 0;
}
LinkedNode *nod = new LinkedNode(val);
LinkedNode *cur = _node;
while(index--){
cur = cur->next;
}
nod->next = cur->next;
cur->next = nod;
_length++;
}
void deleteAtIndex(int index) {
if(index < 0 || index >= _length){
return;
}
LinkedNode *cur = _node;
while(index--){
cur = cur->next;
}
LinkedNode *tmp = cur->next;
cur->next = cur->next->next;
delete tmp;
_length--;
}
//bug在打印函数这里一开始没有定义一个指向node的指针,导致delete的时候
//出了段错误
void printList(){
LinkedNode *cur = _node;
while(cur->next != nullptr){
cout<<cur->next->val;
cur = cur->next;
}
cout<<endl;
}
public:
LinkedNode *_node;
int _length;
};
206.反转链表
题目链接:https://leetcode.cn/problems/reverse-linked-list/
class Solution {
public:
ListNode* reverseList(ListNode* head) {
//双指针法
ListNode *cur = head;
ListNode *pre = nullptr;
ListNode *tmp;
while(cur){
//1、定义一个tmp保存当前节点指向的下一个节点
tmp = cur->next;
//2、把pre赋给cur->next
cur->next = pre;
//3、移动pre
pre = cur;
//4、最后一步是移动当前指针
cur = tmp;
}
return pre;
}
};
总结:链表的各种操作涉及到各种指针的操作,有时候会出现莫名奇妙的问题,需要画图辅助解决问题