题目( 单选题 )
下面函数用“哑结点”统一处理删除单向链表中的头结点与中间结点。横线处应填（ ）。
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 |
struct Node { int val; Node* next; Node(int v) :val(v), next(nullptr) {} }; Node* eraseAll(Node* head, int x) { Node dummy(0); dummy.next = head; Node* cur = &dummy; while (cur->next) { if (cur->next->val == x) { Node* del = cur->next; ______________________ delete del; } else cur = cur->next; } return dummy.next; } |
关注我们
