LeetCode203. 移除链表元素
题目链接:https://leetcode.cn/problems/remove-linked-list-elements/
视频讲解:
自己实现
class Solution {
public:
ListNode* removeElements(ListNode* head, int val) {
ListNode *dir = new ListNode(0);
dir -> next = head;
ListNode *p = dir, *q = head;
while(q) {
if(q -> val == val) {
p -> next = q -> next;
}else {
p = p -> next;
}
q = q -> next;
}
return dir -> next;
}
};
题解
class Solution {
public:
ListNode* removeElements(ListNode* head, int val) {
ListNode* dummyHead = new ListNode(0); // 设置一个虚拟头结点
dummyHead->next = head; // 将虚拟头结点指向head,这样方面后面做删除操作
ListNode* cur = dummyHead;
while (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;
}
};
LeetCode707. 设计链表
题目链接:https://leetcode.cn/problems/design-linked-list/
视频讲解:
自己实现
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) {
LinkedNode *p = _dummyHead;
if(index < 0 || index >= _size) return -1;
for(int i = 0; i <= index; i++) {
p = p -> next;
}
return p -> val;
}
void addAtHead(int val) {
LinkedNode *p = new LinkedNode(val);
p -> next = _dummyHead -> next;
_dummyHead -> next = p;
_size++;
}
void addAtTail(int val) {
LinkedNode * p = _dummyHead;
LinkedNode *temp = new LinkedNode(val);
while(p -> next) p = p -> next;
p -> next = temp;
_size++;
}
void addAtIndex(int index, int val) {
if(index > _size) return;
else if (index == _size) addAtTail(val);
else if(index < 0) addAtHead(val);
else {
LinkedNode *p = _dummyHead;
LinkedNode *temp = new LinkedNode(val);
for(int i = 0; i < index; i++) {
p = p -> next;
}
temp -> next = p -> next;
p -> next = temp;
_size++;
}
}
void deleteAtIndex(int index) {
LinkedNode *p = _dummyHead;
if(index < 0 || index >= _size) return;
for(int i = 0; i < index; i++) {
p = p -> next;
}
p -> next = p -> next -> next;
_size--;
}
private:
int _size;
LinkedNode* _dummyHead;
};
题解
class MyLinkedList {
public:
// 定义链表节点结构体
struct LinkedNode {
int val;
LinkedNode* next;
LinkedNode(int val):val(val), next(nullptr){}
};
// 初始化链表
MyLinkedList() {
_dummyHead = new LinkedNode(0); // 这里定义的头结点 是一个虚拟头结点,而不是真正的链表头结点
_size = 0;
}
// 获取到第index个节点数值,如果index是非法数值直接返回-1, 注意index是从0开始的,第0个节点就是头结点
int get(int index) {
if (index > (_size - 1) || index < 0) {
return -1;
}
LinkedNode* cur = _dummyHead->next;
while(index--){ // 如果--index 就会陷入死循环
cur = cur->next;
}
return cur->val;
}
// 在链表最前面插入一个节点,插入完成后,新插入的节点为链表的新的头结点
void addAtHead(int val) {
LinkedNode* newNode = new LinkedNode(val);
newNode->next = _dummyHead->next;
_dummyHead->next = newNode;
_size++;
}
// 在链表最后面添加一个节点
void addAtTail(int val) {
LinkedNode* newNode = new LinkedNode(val);
LinkedNode* cur = _dummyHead;
while(cur->next != nullptr){
cur = cur->next;
}
cur->next = newNode;
_size++;
}
// 在第index个节点之前插入一个新节点,例如index为0,那么新插入的节点为链表的新头节点。
// 如果index 等于链表的长度,则说明是新插入的节点为链表的尾结点
// 如果index大于链表的长度,则返回空
// 如果index小于0,则在头部插入节点
void addAtIndex(int index, int val) {
if(index > _size) return;
if(index < 0) index = 0;
LinkedNode* newNode = new LinkedNode(val);
LinkedNode* cur = _dummyHead;
while(index--) {
cur = cur->next;
}
newNode->next = cur->next;
cur->next = newNode;
_size++;
}
// 删除第index个节点,如果index 大于等于链表的长度,直接return,注意index是从0开始的
void deleteAtIndex(int index) {
if (index >= _size || index < 0) {
return;
}
LinkedNode* cur = _dummyHead;
while(index--) {
cur = cur ->next;
}
LinkedNode* tmp = cur->next;
cur->next = cur->next->next;
delete tmp;
_size--;
}
// 打印链表
void printLinkedList() {
LinkedNode* cur = _dummyHead;
while (cur->next != nullptr) {
cout << cur->next->val << " ";
cur = cur->next;
}
cout << endl;
}
private:
int _size;
LinkedNode* _dummyHead;
};
LeetCode206. 反转链表
题目链接:https://leetcode.cn/problems/reverse-linked-list/description/
视频讲解:
自己实现
class Solution {
public:
ListNode* reverseList(ListNode* head) {
ListNode *p = NULL, *q = head;
while(q) {
ListNode * temp = q -> next;
q -> next = p;
p = q;
q = temp;
}
return p;
}
};
题解
class Solution {
public:
ListNode* reverseList(ListNode* head) {
ListNode* temp; // 保存cur的下一个节点
ListNode* cur = head;
ListNode* pre = NULL;
while(cur) {
temp = cur->next; // 保存一下 cur的下一个节点,因为接下来要改变cur->next
cur->next = pre; // 翻转操作
// 更新pre 和 cur指针
pre = cur;
cur = temp;
}
return pre;
}
};
总结
- 比较简单,利用好虚拟头结点就可以了