struct ListNode {
int val;
ListNode *next;
};
ListNode* reverseList(ListNode* head) {
ListNode* currNode = head;
ListNode* nextNode = nullptr;
ListNode* prevNode = nullptr;
while (currNode != nullptr) {
nextNode = currNode->next;
currNode->next = prevNode;
prevNode = currNode;
currNode = nextNode;
}
return prevNode;
}
反转链表 C++实现
于 2022-04-13 21:38:37 首次发布