单选题
下面的代码片段用于反转单链表，请进行（ ）修改，使其能正确实现相应功能。
ListNode* reverseLinkedList(ListNode* head) {\tListNode* prev = nullptr;\tListNode* current = head;\twhile (current != nullptr) {\t\tListNode* next = current->next;\t\tcurrent->next = next;\t\tprev = current;\t\tcurrent = next;\t}\treturn 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;
发表评论 取消回复