Question Type: Medium 🎚️
Complexities: Time: O(n), Space: O(n) 🚩
Code: 👇
class Solution {
public:
ListNode* reverseList(ListNode* head) {
if (!head || !head->next)
return head;
public:
ListNode* reverseList(ListNode* head) {
if (!head || !head->next)
return head;
ListNode* newHead = reverseList(head->next);
head->next->next = head;
head->next = nullptr;
return newHead;
}
};
