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 *Head = new ListNode(0);
Head->next = head;
ListNode * p = Head;
ListNode * del =nullptr;
while(p->next!=NULL)
{
if(p->next->val == val)
{
del = p->next;
p->next = p->next->next;
delete del;
}else{
p = p->next;
}
}
head = Head->next;
delete Head;
return head;
}
};
2.不加头结点,考虑头结点删除的情况
/**
* 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) {
//处理头结点值为val的情况
ListNode* del = nullptr;
while(head!=NULL&&head->val == val)
{
del = head;
head = head->next;
delete del;
}
//头结点值不为val
ListNode* p = head;
while(head!=NULL && head->next!=NULL)
{
if(head->next->val == val)
{
del = head->next;
head->next = head->next->next;
delete del;
}else
{
head = head->next;
}
}
return p;
}
};
3.递归法
提供一个思路,但是个人不推荐用这种,未考虑内存空间的释放
/**
* 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) {
if (head == NULL) return NULL;
head->next = removeElements(head->next,val);
return head->val==val ? head->next : head;
}
};
懒得写直接搬过来了(= =)
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;
};
这种写法就是将原链表一个一个摘下来,头插法插入虚拟头结点后面
/**
* 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) {
//设置虚拟头结点,用头插法翻转
if (head == NULL || head->next == NULL) return head;
ListNode* Head = new ListNode(0);
ListNode* p = head;
ListNode* q = head->next;
while(p!=NULL)
{
p->next = Head->next;
Head->next = p;
p = q;
if(q!=NULL) q = q->next;
}
head = Head->next;
delete Head;
return head;
}
};
非递归,原地翻转
/**
* 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) {
//原地翻转
if (head == NULL || head->next == NULL) return head;
ListNode* p = head->next;
ListNode* q = p->next;
head->next = NULL;
while(p!=NULL)
{
p->next = head;
head = p;
p = q;
if(q!=NULL) q = q->next;
}
return head;
}
};
//同样也是原地翻转,可参考
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;
}
};
递归法:主要是要从整体的角度去理解,别专进去理解递归,在翻转了第二个元素以及其后的元素 ListNode* p = reverseList(head->next);注意此时的head的next指向第二个元素,第二个元素的next指向head
/**
* 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) {
//递归原地翻转
if (head == NULL || head->next == NULL) return head;
ListNode* p = reverseList(head->next);
//注意此时的head的next指向第二个元素,第二个元素的next指向head
head->next->next = head;
head->next = NULL;
return p;
}
};