剑指 Offer 18. 删除链表的节点
题目
代码
class Solution {
public:
ListNode* deleteNode(ListNode* head, int val) {
if(head->val == val)
return head->next;
auto pre = head, cur = head->next;
while(cur != nullptr && cur->val != val) {
pre = cur;
cur = cur->next;
}
if(cur != nullptr)
pre->next = cur->next;
return head;
}
};

浙公网安备 33010602011771号