剑指 Offer 18. 删除链表的节点
原创
©著作权归作者所有:来自51CTO博客作者蒟蒻的颖的原创作品,请联系作者获取转载授权,否则将追究法律责任
题目链接
18. 删除链表的节点
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* deleteNode(ListNode* head, int val) {
std::ios::sync_with_stdio(false);
if(!head || !head->next) return head;
auto dummy = new ListNode(-1);
dummy->next = head;
ListNode* p = dummy;
while(p->next){
if(p->next->val == val)
p->next = p->next->next;
else p = p->next;
}
auto res = dummy->next;
delete dummy;
return res;
}
};