下面的代码片段用于反转单链表，请进行（ ）修改，使其能正确实现相应功能。
ListNode* reverseLinkedList(ListNode* head) {
ListNode* prev = nullptr;
ListNode* current = head;
while (current != nullptr) {
ListNode* next = current->next;
current->next = next;
prev = current;
current = next;
}
return prev;
}
- A.
current->next = next;应该改为current->next = prev; - B.
ListNode* next = current->next;应该改为ListNode* next = prev->next; - C.
current != nullptr应该改为current->next != nullptr - D.
ListNode* prev = nullptr;应该改为ListNode* prev = head;