下面的代码片段用于在双向链表中删除一个节点。请在横线处填入（ ），使其能正确实现相应功能。 void deleteNode(DoublyListNode*& head, int value) { DoublyListNode* current = head; while (current != nullptr && current->val != value) { current = current->next; } if (current != nullptr) { if (current->prev != nullptr) { ____________________________________ // 在此处填入代码 } else { head = current->next; } if (current->next != nullptr) { current->next->prev = current->prev; } delete current; } }
A：if (current->next != nullptr) current->next->prev = current->prev;
B：current->prev->next = current->next;
C：delete current->next;
D：current->prev = current->next;
正确答案：B
试卷来源：202403 CCF-GESP编程能力等级认证C++五级真题