题目:删除链表指定值的结点
来源:Leetcode
递归
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* removeElements(ListNode* head, int val) {
// 终止条件
if (!head) return nullptr;
// 先遍历到链表尾
head->next = removeElements(head->next, val);
// 可以看出,返回的结点将作为上一个结点的Next结点
// 因此在这里我们需判断,该值是否等于Val
return head->val == val ? head->next : head;
}
};
迭代
迭代版本较为简单,维持两个指针变量即可转化为单链表的删除基本操作
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* removeElements(ListNode* head, int val) {
auto LHead = new ListNode(0);
LHead->next = head;
ListNode *p = head, *pre = LHead, *q;
while (p != NULL){
if (p->val == val){
q = p;
p = p->next;
pre->next = p;
delete q;
}
else{
p = p->next;
pre = pre->next;
}
}
return LHead->next;
}
};